I'm trying to determine the time complexity of the following method. At the beginning I have three for loops which would yield m^3. I don't know how to determine, what is the time complexity of the recursive call at the end of the method. 

Can someone help me with this?

```
void p(int n, int m) {
    int i,j,k ;
    if (n > 0) {
        for (i=0 ; i < m ; i++)
            for (j=0 ; j < m ; j++)
                for (k=0 ; k < m ; k++)
                    System.out.println(i+j*k) ;  
        p(n/m, m) ;
    }
 }

```