B'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 xe2 x80 x93 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, xe2 x80 x89y). Valera wants to place exactly k tubes on his rectangle table. A tube is such sequence of table cells (x1, xe2 x80 x89y1), (x2, xe2 x80 x89y2), ..., (xr, xe2 x80 x89yr), that: Valera thinks that the tubes are arranged in a fancy manner if the following conditions are fulfilled: Help Valera to arrange k tubes on his rectangle table in a fancy manner. The first line contains three space-separated integers n, xe2 x80 x89m, xe2 x80 x89k (2 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n, xe2 x80 x89m xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89300; 2 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x892k xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xc2 xb7m) -- the number of rows, the number of columns and the number of tubes, correspondingly. Print k lines. In the i-th line print the description of the i-th tube: first print integer ri (the number of tube cells), then print 2ri integers xi1, xe2 x80 x89yi1, xe2 x80 x89xi2, xe2 x80 x89yi2, xe2 x80 x89..., xe2 x80 x89xiri, xe2 x80 x89yiri (the sequence of table cells). If there are multiple solutions, you can print any of them. It is guaranteed that at least one solution exists. Picture for the first sample: Picture for the second sample: '...