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.
import sys
import math
import collections
import heapq
import decimal
input=sys.stdin.readline
n,m,k=(int(i) for i in input().split())
x,y=0,0
c=0
l=[]
for i in range(k-1):
    if(c%2==0):
        if(y<m-1):
            l.append([x+1,y+1,x+1,y+2])
            y+=2
            if(y==m):
                c+=1
                x+=1
        elif(y==m-1):
            l.append([x+1,y+1,x+2,y+1])
            x+=1
            y-=1
            c+=1
    else:
        if(y>0):
            l.append([x+1,y+1,x+1,y])
            y-=2
            if(y==0):
                c+=1
                x+=1
        elif(y==0):
            l.append([x+1,y+1,x+2,y+1])
            x+=1
            y+=1
            c+=1
l1=[]
while(x!=n):
    if(c%2==0):
        l1.append(x+1)
        l1.append(y+1)
        if(y<m-1):
            y+=1
        else:
            x+=1
            c+=1
    else:
        l1.append(x+1)
        l1.append(y+1)
        if(y>0):
            y-=1
        else:
            x+=1
            c+=1
l.append(l1)
for i in range(len(l)):
    print(len(l[i])//2,*l[i])