#include <bits/stdc++.h>
using namespace std;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) cout << #v << "=" << endl; REP(i, v.size()){ cout << v[i] << ","; } cout << endl;
#define mdebug(m) cout << #m << "=" << endl; REP(i, m.size()){ REP(j, m[i].size()){ cout << m[i][j] << ","; } cout << endl;}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;
#define Add(x, y) x = (x + (y)) % mod
#define Mult(x, y) x = (x * (y)) % mod

struct edge{int to, cost;};

class Graph
{
public:
    int N;
    vector<vector<edge>> G;
    vec label;
    bools used;

    Graph(int N): N(N){
        G = vector<vector<edge>>(N, vector<edge>(0));
        label = vec(N, 0);
        used = bools(N, false);
    }

    void add_edge(int from, int to, int cost = 0){
        G[from].push_back(edge({to, cost}));
    }

    void add_edge2(int v1, int v2, int cost = 0){
        add_edge(v1, v2, cost);
        add_edge(v2, v1, cost);
    }

    void dfs(int v, int l){
        used[v] = true;
        label[v] = l;
        for(auto e: G[v]) if(!used[e.to]) dfs(e.to, 1 - l);
    }

};

void makeGraph(Graph &G, int N, int D){
    pairs p;
    FOR(i, -600, 601) FOR(j, -600, 601) if(i * i + j * j == D) p.pb(Pii(i, j));
    REP(i, N) REP(j, N){
        for(Pii q: p){
            int i0 = i + q.f, j0 = j + q.s;
            if(i0 >= 0 && i0 < N && j0 >= 0 && j0 < N) G.add_edge(i * N + j, i0 * N + j0);
        }
    }
}

signed main(){

    int N, D1, D2; cin >> N >> D1 >> D2;
    Graph G1(4 * N * N), G2(4 * N * N);
    makeGraph(G1, 2 * N, D1);
    makeGraph(G2, 2 * N, D2);
    REP(i, 4 * N * N){
        if(!G1.used[i]) G1.dfs(i, 1);
        if(!G2.used[i]) G2.dfs(i, 1);
    }
    vec c(4 * N * N), cnt(4);
    REP(i, 4 * N * N){
        c[i] = G1.label[i] + 2 * G2.label[i];
        cnt[c[i]]++;
    }
    int k;
    pairs ans;
    REP(i, 4) if(cnt[i] >= N * N) k = i;
    REP(i, 4 * N * N) if(c[i] == k) ans.pb(Pii(i / (2 * N), i % (2 * N)));
    REP(i, N * N) cout << ans[i].f << " " << ans[i].s << endl; 

    return 0;
}


Measured memory_bytes: 305908