Complexity class for loop with two inner loops

Question

I have an algorithm like the following

for(int k) {
    statement1;
    for(int j) {
        statement2;
    }
    for(int m) {
        statement3;
    }
 }

j => m

Is it correct for me to conclude that the complexity class is O(n^2)?