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.

n,m,k=map(int,input().split());x=1;y=1;inc=1;tot=0
def check(x,y,inc):
    if(y<1):return [x+1,1,1]
    elif(y>m):return [x+1,m,-1]
    else: return [x,y,inc]
while(k!=1):
    print(2,end=' ')
    l=check(x,y+inc,inc)
    x1=l[0];y1=l[1];inc=l[2]
    print(x,y,x1,y1)
    l=check(x1,y1+inc,inc)
    x=l[0];y=l[1];inc=l[2]
    k-=1;tot+=2
if(n*m-tot>0):
    print(n*m-tot,end=' ')
    while(x<=n):
        print(x,y,end=' ')
        l=check(x,y+inc,inc)
        x=l[0];y=l[1];inc=l[2]
    