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.
r,c,k=list(map(int,input().split()))

p=0
ans=[]
row=1
col=1
rever=0
i=1
mota=0
while(i<=k-1):
    if c%2==0:
        ans=([row,col,row,col+1])
        print(2,*ans)
        mota+=1
        i+=1
        col+=2
        if col==c:
            row+=1
            col=1
    if c%2==1:
        if rever==0:
            ans=([row,col,row,col+1])
            print(2,*ans)
            mota+=1
            col+=2
            i+=1
            if col==c and i!=k:
                rever=1
                i+=1
                ans=([row,col,row+1,col])
                print(2,*ans)
                mota+=1
                
                row=row+1

                col-=1
            continue
        if rever==1:
            ans=([row,col,row,col-1])
            print(2,*ans)
            mota+=1
            i+=1
            col-=2
            if col==0 and i!=k:
                rever=0
                i+=1
                ans=([row,col,row+1,col])
                print(2,*ans)
                mota+=1
                row+=1
                col+=1
g=[]
#print(ans)
ans=[]
#print('l')
print(r*c-2*mota,end=' ')
while(row<r+1):
    if rever==0:
        while(col!=c+1):
            print(row,end=' ')
            print(col,end=' ')
            col+=1
        row+=1
        col-=1
        rever=1
        continue
    if rever==1:
        while(col!=0):
            print(row,end=' ')
            print(col,end=' ')
            col-=1
        rever=0
        row+=1
        col+=1

    
        
        
    
        
        
    
    
                    
            
        