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.
def spiralPrint(m, n,limit):
    k = 0
    l = 0
    r,c=m,n
    ans=[]
    ''' k - starting row index
        m - ending row index
        l - starting column index
        n - ending column index
        i - iterator '''

    while (k < m and l < n):

        # Print the first row from
        # the remaining rows
        for i in range(l, n):
            # print(a[k][i], end=" ")
            ans.append(k+1)
            ans.append(i+1)

        k += 1

        # Print the last column from
        # the remaining columns
        for i in range(k, m):
            # print(a[i][n - 1], end=" ")
            ans.append(i+1)
            ans.append(n-1+1)
        n -= 1

        # Print the last row from
        # the remaining rows
        if (k < m):

            for i in range(n - 1, (l - 1), -1):
                # print(a[m - 1][i], end=" ")
                ans.append(m-1+1)
                ans.append(i+1)
            m -= 1

        # Print the first column from
        # the remaining columns
        if (l < n):
            for i in range(m - 1, k - 1, -1):
                # print(a[i][l], end=" ")
                ans.append(i+1)
                ans.append(l+1)
            l += 1
    j=0
    while(limit>1):
        print(4,end=" ")
        for i in range(4//2):
            print(ans[i+j],end=" ")
        print()
        j+=4
        limit-=1
    print((len(ans)-j)//2,end=" ")
    for i in range(j,len(ans)):
        print(ans[i],end=" ")

l = list(map(int,input().split()))
spiralPrint(l[0],l[1],l[2])
