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=3,3,4
n,m,k=map(int, input().split(" "))
def maketubes(n,m):
    a=[]
    i=1
    while(i<n and i<m):
        for j in range(i,m-(i-1)+1):
            a.append([i,j])
        for j in range(i+1,n-(i-1)+1):
            a.append([j,m-(i-1)])
        for j in range(m-i,i-1,-1):
            a.append([n-(i-1),j])
        for j in range(n-i,i,-1):
            a.append([j,i])
        i+=1
    return a
arr=maketubes(n,m)
def printf(i,j):
    a=""
    for k in range(i,j):
        c,d=arr[k]
        a+=str(c)+ " " + str(d) + " "        
    return a[:-1]
tube=(n*m)//k
tubes=[tube]*k
tubes[k-1]+=n*m -tube*k
start=0
for i in tubes:
    end=start+i
    print(i,printf(start,end))
    start=end