#include <iostream>
#include <utility>
#include <cstdlib>
using namespace std;
constexpr const int d[][2]{{-2, -1}, {-2, 1}, {-1, -2}, {-1, 2}, {2, -1}, {2, 1}, {1, -2}, {1, 2}};
bool book[505][505];
int n, m, K, dis[505][505];
pair<int, int> path[250052];
void DFS(const int step, const int x, const int y)
{
	if (step <= K)
	{
		if (x != n || y != m)
		{
			book[x][y] = 1;
			for (const auto &i : d)
			{
				const int nx = x + i[0], ny = y + i[1];
				if ((1 <= nx && nx <= n) && (1 <= ny && ny <= m) && !book[nx][ny] && step + dis[nx][ny] <= K)
				{
					path[step].first = nx;
					path[step].second = ny;
					DFS(step + 1, nx, ny);
				}
			}
			book[x][y] = 0;
		}
	}
	else if (x == n && y == m)
	{
		for (int i = 1; i <= K; ++i)
			cout << path[i].first << ' ' << path[i].second << '\n';
		exit(0);
	}
	return;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n >> m >> K;
	for (int i = 1; i <= n; ++i)
	{
		auto &dis_i = dis[i];
		for (int j = 1; j <= m; ++j)
			dis_i[j] = -2147483647;
	}
	dis[path[1].first = n][path[1].second = m] = 0;
	for (int head = 1, tail = 2; head < tail; ++head)
	{
		const int x = path[head].first, y = path[head].second;
		for (const auto &i : d)
		{
			const int nx = x + i[0], ny = y + i[1];
			if ((1 <= nx && nx <= n) && (1 <= ny && ny <= m) && dis[nx][ny] == -2147483647)
			{
				dis[path[tail].first = nx][path[tail].second = ny] = dis[x][y] + 1;
				++tail;
			}
		}
	}
	DFS(1, 1, 1);
	return 0;
}