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())
ans=[]
i=1
j=1
gg = (n*m)//2
for g in range(gg):
    if i%2!=0:
        if j!=m:
            ans.append([i,j,i,j+1])
            j+=2
            if j==m+1:
                j=m
                i+=1
        else:
            ans.append([i,j,i+1,m])
            i+=1
            j=m-1   
    else:
        if j!=0:
            ans.append([i,j,i,j-1])
            j-=2
            if j==0:
                j=1
                i+=1
        else:
            ans.append([i,j,i+1,1])
            j=2
            i+=1
x,y,z,q =ans[-1]
if n%2!=0 and q!=m:
    ans[-1]+=[n,m]
elif n%2==0 and q!=1:
    ans+=[n,1]    
aa=[]
c=1            
           
for i in ans[:k-1]:
    print(len(i)//2,end=' ')
    print(*i)
for i in ans[k-1:]:
    aa+=i
print(len(aa)//2,end=' ')
print(*aa)                    



