#include <bits/stdc++.h>

using i64 = long long;

constexpr int dx[] = {-2, -1, -2, 1, -1, 2, 1, 2};
constexpr int dy[] = {-1, -2, 1, -2, 2, -1, 2, 1};

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int n, m, t;
    std::cin >> n >> m >> t;
    
    std::vector vis(n, std::vector<bool>(m));
    std::vector<std::pair<int, int>> ans;
    int p[8];
    std::iota(p, p + 8, 0);
    
    while (true) {
        std::mt19937 rng;
        std::shuffle(p, p + 8, rng);
        int tot = 0;
        auto dfs = [&](auto self, int x, int y, int t) {
            tot++;
            // std::cerr << x << " " << y << " " << t << "\n";
            vis[x][y] = true;
            if (n - 1 - x > 2 * t || m - 1 - y > 2 * t || n - 1 - x + m - 1 - y > 3 * t) {
                return;
            }
            if (tot > 1E6) {
                return;
            }
            if (x == n - 1 && y == m - 1) {
                if (t == 0) {
                    for (auto [x, y] : ans) {
                        std::cout << x + 1 << " " << y + 1 << "\n";
                    }
                    std::exit(0);
                }
                return;
            }
            for (int k = 0; k < 8; k++) {
                int nx = x + dx[p[k]];
                int ny = y + dy[p[k]];
                if (0 <= nx && nx < n && 0 <= ny && ny < m && !vis[nx][ny]) {
                    ans.emplace_back(nx, ny);
                    self(self, nx, ny, t - 1);
                    ans.pop_back();
                }
            }
            vis[x][y] = false;
        };
        dfs(dfs, 0, 0, t);
    }
    
    return 0;
}