```
int sum=0;
for(i1=0,i1<m,i++){
for(i2=0,i2<m,i++){
for(i3=0,i3<m,i++){
...
...
...
for(im=0,im<m,i++){
sum += a[i1][i2][i3]...[im];
}
}
}
}
```

What is the time complexity of the above code?

btw, I always having problems related to time complexity, do you guys got some good article on it?

especially about the step count and loops and the growth rate of big-oh