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
# sys.setrecursionlimit(1000000)
input = sys.stdin.readline

def solve(n, m, k):
    ans = []
    left = n*m
    x, y = 0, 0
    flag = True
    k -= 1
    while k >= 0:
        curr = []
        while left > 2*k:
            if y == m:
                x += 1
                y = m-1
                flag = False
            if y == -1:
                x += 1
                y = 0
                flag = True
            curr.append(x+1)
            curr.append(y+1)
            if flag:
                y += 1
            else:
                y -= 1
            left -= 1
        ans.append(curr)
        k -= 1
                
    return ans

# t = int(input())
t = 1
for _ in range(t):
    n, m, k = map(int, input().split())
    
    res = solve(n, m, k)
    for each in res:
        print(len(each) // 2, end=" ")
        print(*each)
    