Problem Statment

You're given a matrix of N rows and M columns, and Q queries. (1 <= N, M, Q <= 1000)
For each query Q (x, y, c), you need to rotate clockwise the square child matrix whose upper left corner is (x, y) and lower right corner is (x + c — 1, y + c — 1).
Print the final matrix as result.