for (i = 0; i < 5; i++) {
  for (j = 0; j < 3; j++) {
    // O(1) work
  }
}

Total iterations: 15

Complexity: O(n·m) = O(15 operations)