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())

x = 0
y = 0
p = 'right'
end = False

f = [[' ' for y in range(n)] for x in range(m)]

def getnext():
    global n, m, f, p
    global x, y, end

    c = 0

    f[x][y] = '*'
    while 1:
        if p == 'right':
            if x < m-1 and f[x+1][y] != '*':
                x+=1
                return
            else:
                p = 'bot'
        if p == 'bot':
            if y < n-1 and f[x][y+1] != '*':
                y+=1
                return
            else:
                p = 'left'
        if p == 'left':
            if x > 0 and f[x-1][y] != '*':
                x-=1
                return
            else:
                p = 'top'
        if p == 'top':
            if y > 0 and f[x][y-1] != '*':
                y-=1
                return
            else:
                p = 'right'
                c += 1
        if c == 3:
            end = True
            return


oldx = oldy = 1000

e = []

while not end:
    if (x!=oldx or y!=oldy):
        e.append((x+1, y+1))
        oldy = y
        oldx = x
        getnext()
    else:
        break

while(k > 1):
    b, b1 = e.pop(0)
    a, a1 = e.pop(0)
    print(2, a, a1, b, b1)
    k -= 1

print(len(e), end=' ')
for i in e:
    print(i[1], i[0], end=' ')
