#include <bits/stdc++.h>

using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()

template<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }

template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type
fill_v(T &t, const V &v) { t=v; }
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }

template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a){
    out<<'('<<a.first<<','<<a.second<<')'; return out;
}
template<typename T>
istream& operator >> (istream& is, vector<T>& vec){
    for(T& x: vec) {is >> x;} return is;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
    out<<'['; for(T i: a) {out<<i<<',';} out<<']'; return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1<<30;
const ll LLINF = 1LL<<60;
const ll MOD = 1000000007;

vector<ll> solve(ll n, ll d) {
    vector<vector<ll>> g(4*n*n);
    REP(i, n*2) REP(j, n*2) {
        // (i,j)から距離がsqrt(D1)のマス
        ll x = n*2-1;
        FOR(y, i, n*2) {
            while(x > j && (y-i)*(y-i)+(x-j)*(x-j) > d) x--;
            if((y-i)*(y-i)+(x-j)*(x-j) == d) {
                g[y*2*n+x].push_back(i*n*2+j);
                g[i*2*n+j].push_back(y*n*2+x);
            }
        }
        x = 0;
        FOR(y, i+1, n*2) {
            while(x < j && (y-i)*(y-i)+(x-j)*(x-j) > d) x++;
            if((y-i)*(y-i)+(x-j)*(x-j) == d) {
                g[y*2*n+x].push_back(i*n*2+j);
                g[i*2*n+j].push_back(y*n*2+x);
            }
        }
    }

    // REP(i, 4*n*n) {
    //     cout << "(" << i%(n*2) << "," << i/(n*2) << "): ";
    //     for(auto j: g[i]) {
    //         cout << "(" << j%(n*2) << "," << j/(n*2) << ") ";
    //     }
    //     cout << endl;
    // }

    vector<ll> col(4*n*n);
    function<void(ll, ll)> dfs = [&](ll v, ll c) {
        col[v] = c;
        for(auto to: g[v]) {
            assert(col[to] != c);
            if(col[to] == 0) {
                dfs(to, -c);
            }
        }
    };
    
    REP(i, 4*n*n) {
        if(col[i] == 0) dfs(i, 1);
    }
    return col;
}

signed main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll n, d1, d2;
    cin >> n >> d1 >> d2;

    vector<ll> col1 = solve(n, d1);
    vector<ll> col2 = solve(n, d2);

    // cout << col1 << endl << col2 << endl;

    vector<vector<PII>> v(4);
    REP(i, 4*n*n) {
        if(col1[i] == -1) col1[i] = 0;
        if(col2[i] == -1) col2[i] = 0;
        v[col1[i]*2 + col2[i]].push_back({i%(n*2), i/(n*2)});
    }

    REP(i, 4) {
        if(v[i].size() < n*n) continue;
        REP(j, n*n) {
            cout << v[i][j].first << " " << v[i][j].second << endl;
        }
        return 0;
    }

    assert(false);

    return 0;
}


Measured memory_bytes: 124800