#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
//#define ll __int128
#define int ll
//#define int ll
//#define char ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;

#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;

#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif

const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";


template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
    return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1>
inline istream & operator >> (istream &in, pair<T0, T1> &a) {
    return in >> a.first >> a.second;
}

template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " <<  get<3>(a) << "}";
}

template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
    out << "[";
    fori (i, a.size())
        out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
    return out;
}


void smain();



signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
#ifdef MAX_HOME
    freopen("input.txt", "r", stdin);
    clock_t start = clock();
#endif
    cout << setprecision(12) << fixed;
    smain();
#ifdef MAX_HOME
    cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
    return 0;
}

const int N = sqr(602);
vi g[3][N];
int used[N];
int col[N];

void dfs(int v, int c, int xr) {
    col[v] = c;
    used[v] |= xr;

    for (int to : g[xr][v]) {
        if (used[to] & xr) {
            continue;
        }
        dfs(to, c ^ xr, xr);
    }
}

void smain() {

    int n, d1, d2;
    cin >> n >> d1 >> d2;
    vi di, dj;
    for (int i = -2 * n; i <= 2 * n; ++i) {
        for (int j = -2 * n; j <= 2 * n; ++j) {
            int dst = sqr(i) + sqr(j);
            if (dst == d1) {
                di.push_back(i);
                dj.push_back(j);
            }
        }
    }
    fori (i, 2 * n) {
        fori (j, 2 * n) {
            fori (dir, SZ(di)) {
                int ii = i + di[dir], jj = j + dj[dir];
                if (ii >= 0 && ii < 2 * n && jj >= 0 && jj < 2 * n) {
                    g[1][i * n * 2 + j].push_back(ii * n * 2 + jj);
                    g[1][ii * n * 2 + jj].push_back(i * n * 2 + j);
                }
            }
        }
    }

    di.clear();
    dj.clear();

    for (int i = -2 * n; i <= 2 * n; ++i) {
        for (int j = -2 * n; j <= 2 * n; ++j) {
            int dst = sqr(i) + sqr(j);
            if (dst == d2) {
                di.push_back(i);
                dj.push_back(j);
            }
        }
    }

    fori (i, 2 * n) {
        fori (j, 2 * n) {
            fori (dir, SZ(di)) {
                int ii = i + di[dir], jj = j + dj[dir];
                if (ii >= 0 && ii < 2 * n && jj >= 0 && jj < 2 * n) {
                    g[2][i * n * 2 + j].push_back(ii * n * 2 + jj);
                    g[2][ii * n * 2 + jj].push_back(i * n * 2 + j);
                }
            }
        }
    }


    fori (i, 4 * n * n) {
        if (used[i])
            continue;
        dfs(i, 0, 1);
    }

    vi a, b;
    fori (i, 4 * n * n) {
        if (col[i])
            a.push_back(i);
        else
            b.push_back(i);
    }

    if (SZ(a) < SZ(b))
        swap(a, b);

    for (auto v : a) {
        if (used[v] & 2)
            continue;
        dfs(v, 0, 2);
    }
    vi aa, bb;

    for (auto v : a) {
        if (col[v] & 2)
            aa.push_back(v);
        else
            bb.push_back(v);
    }
    if (SZ(aa) < SZ(bb))
        swap(aa, bb);
    assert(aa.size() >= n * n);
    aa.resize(n * n);
    for (auto x : aa) {
        cout << x / (2 * n) << ' ' << x % (2 * n) << '\n';
    }

}

Measured memory_bytes: 322684