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, math, itertools, random, bisect
from collections import defaultdict
# sys.setrecursionlimit(999999999)
INF = 10**18
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))
def input(): return sys.stdin.readline().strip()
mod = 10**9 + 7

# MAX = 100001

# def sieve():
# 	isPrime = [True]*(MAX)
# 	isPrime[0] = False
# 	isPrime[1] = False

# 	for i in range(2,MAX):
# 		if isPrime[i]:
# 			for j in range(i*i, MAX, i):
# 				isPrime[j] = False
    
# 	primes = [2]
# 	for i in range(3,MAX,2):
# 		if isPrime[i]: primes.append(i)
# 	return primes
    
test = 1
# test = int(input())
for _ in range(test):
    n,m,k = get_ints()
    # a = get_array()
    row = 1
    col = 1
    right = True
    for i in range(k-1):
        if right:
            if col==m:
                print(2, row, col, row+1, col)
                col -= 1
                row += 1
                right = False
            else:
                print(2, row, col, row, col+1)
                col += 2
        else:
            if col==1:
                print(2, row, col, row+1, col)
                row += 1
                col += 1
                right = True
            else:
                print(2, row, col, row, col-1)
                col -= 2

    rem = n*m - 2*(k-1)
    ans = [rem]
    for i in range(rem):
        if right:
            if col==m:
                ans.append(row)
                ans.append(col)
                row += 1
                right = False
            else:
                ans.append(row)
                ans.append(col)
                col += 1
        else:
            if col==1:
                ans.append(row)
                ans.append(col)
                row += 1
                right = True
            else:
                ans.append(row)
                ans.append(col)
                col -= 1
    print(*ans)
                

    


