Valera has got a rectangle table consisting of *n* rows and *m* columns. Valera numbered the table rows starting from one, from top to bottom and the columns – starting from one, from left to right. We will represent cell that is on the intersection of row *x* and column *y* by a pair of integers (*x*, *y*).

Valera wants to place exactly *k* tubes on his rectangle table. A tube is such sequence of table cells (*x*<sub class="lower-index">1</sub>, *y*<sub class="lower-index">1</sub>), (*x*<sub class="lower-index">2</sub>, *y*<sub class="lower-index">2</sub>), ..., (*x*<sub class="lower-index">*r*</sub>, *y*<sub class="lower-index">*r*</sub>), that: 
 -  *r* ≥ 2; -  for any integer *i* (1 ≤ *i* ≤ *r* - 1) the following equation |*x*<sub class="lower-index">*i*</sub> - *x*<sub class="lower-index">*i* + 1</sub>| + |*y*<sub class="lower-index">*i*</sub> - *y*<sub class="lower-index">*i* + 1</sub>| = 1 holds; -  each table cell, which belongs to the tube, must occur exactly once in the sequence. 
Valera thinks that the tubes are arranged in a fancy manner if the following conditions are fulfilled: 
 -  no pair of tubes has common cells; -  each cell of the table belongs to some tube. 
Help Valera to arrange *k* tubes on his rectangle table in a fancy manner.
The first line contains three space-separated integers *n*, *m*, *k* (2 ≤ *n*, *m* ≤ 300; 2 ≤ 2*k* ≤ *n*·*m*) — the number of rows, the number of columns and the number of tubes, correspondingly.
#include <bits/stdc++.h>
using namespace std;

int main() {
    int n, m, k;
    cin>>n>>m>>k;

    if(n < m && k != 1) {
        for(int i = 0; i < k - 1; i++) {
            cout<<2<<" "<<i+1<<" "<<1<<" "<<i+1<<" "<<2<<endl;
        }
        cout<<m*n-2*(k-1)<<" ";
        for(int i = k - 1; i < n; i++) {
            cout<<i+1<<" "<<1<<" "<<i+1<<" "<<2<<" ";
        }
        for(int i = n; i > 0; i--) {
            for(int j = 3; j < m + 1; j++)
                cout<<i<<" "<<j<<" ";
        }
    }
    else if ( n >= m && k != 1) {
        for(int i = 0; i < k - 1; i++) {
            cout<<2<<" "<<1<<" "<<i + 1<<" "<<2<<" "<<i + 1<<endl;
        }
        cout<<m*n-2*(k-1)<<" ";
        for(int i = k - 1; i < n; i++) {
            cout<<1<<" "<<i + 1<<" "<<2<<" "<<i + 2<<" ";
        }
        for(int j = m; j > 0; j--) {
            for(int i = 3; i < n + 1; i++)
                cout<<i<<" "<<j<<" ";
        }
    }
    else {
        cout<<m*n<<" ";
        for(int i = 1; i < n + 1; i++) {
            for(int j = 1; j < m + 1; j++)
                cout<<i<<" "<<j<< " ";
        }
    }
    cout<<endl;
}