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.
arr=[int(x) for x in input().split()]
n=arr[0]
m=arr[1]
k=arr[2]
arr=[[1 for j in range(m)] for i in range(n)]
row=1
col=1
c=0
ans=[]
l1,l2,l3,l4=[1,m],[1,n],[m,1],[n,1]
while(c<(n*m)):
    for i in range(l1[0],l1[1]+1):
        c+=1  
        ans.append([l4[1],i])
    l2[0]+=1
    l4[1]+=1
  #  print(c)
    for i in range(l2[0],l2[1]+1):
        c+=1
        ans.append([i,l1[1]])
    l1[1]-=1    
    l3[0]-=1
  #  print(c)
    for i in range(l3[0],l3[1]-1,-1):
        c+=1
        ans.append([l2[1],i])
    l2[1]-=1
    l4[0]-=1
  #  print(c,l4)
    for i in range(l4[0],l4[1]-1,-1):
        c+=1
        ans.append([i,l3[1]])
    l3[1]+=1
    l1[0]+=1
  #  print(c)
k-=1
i=0
while(k>0):
    print(2,ans[i][0],ans[i][1],ans[i+1][0],ans[i+1][1])
    i+=2
    k-=1
ans=ans[i:] 
print(len(ans),end=" ")
for ele in ans:
    print(ele[0],ele[1],end=" ")
    