#include <bits/stdc++.h>
using namespace std;

using ll=long long;
#define rng(i,l,r) for(int i=int(l);i<int(r);i++)
#define rep(i,r) rng(i,0,r)
#define rrng(i,l,r) for(int i=int(r)-1;i>=int(l);i--)
#define rrep(i,r) rrng(i,0,r)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))
#define F first
#define S second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
#define inf INT_MAX/2-100
#define infl LLONG_MAX/3
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<' '<<#x<<' '<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u>void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u>void chmin(t&a,u b){if(b<a)a=b;}

template<class t>using vc=vector<t>;
template<class t>using vvc=vector<vector<t>>;

using pi=pair<int,int>;
using pl=pair<ll,ll>;
using vi=vc<int>;
using vl=vc<ll>;


ll readl(void){
	ll x;
	cin>>x;
	return x;
}
int readi(void){
	int x;
	cin>>x;
	return x;
}

string readstr(){
	string s;
	cin>>s;
	return s;
}
vi readvi(int n,int off=0){
	vi v(n);
	rep(i,n)v[i]=readi(),v[i]+=off;
	return v;
}

vl readvl(int n,int off=0){
	vl v(n);
	rep(i,n)v[i]=readl(),v[i]+=off;
	return v;
}

template<class t>
void print(t x,int suc=1){
	cout<<x;
	if(suc==1)cout<<"\n";
	if(suc==2)cout<<" ";
}

template<class t>
void print(const vc<t>&v,int suc=1){
	rep(i,si(v))print(v[i],i==int(si(v))-1?1:suc);
}

template<class t>
bool inc(t a,t b,t c){
	return !(c<b||b<a);
}

template<class t>
void compress(vc<t>&v){
	sort(all(v));
	v.erase(unique(all(v)),v.ed);
}

template<class t>
int lwb(const vc<t>&v,const t&a){
	return lower_bound(all(v),a)-v.bg;
}

template<class t>
struct Compress{
	vc<t>v;
	Compress()=default;
	Compress(const vc<t>&x){
		add(x);
	}
	Compress(const initializer_list<vc<t> >&x){
		for(auto &p:x)add(p);
	}
	void add(const t&x){
		v.eb(x);
	}
	void add(const vc<t>&x){
		copy(all(x),back_inserter(v));
	}
	void build(){
		compress(v);
	}
	int get(const t&x)const{
		return lwb(v,x);
	}
	vc<t>get(const vc<t>&x)const{
		vc<t>res(x);
		for(auto &p:res)p=get(p);
		return res;
	}
	const t &operator[](int x)const{
		return v[x];
	}
};
void Yes(bool ex=true){
	cout<<"Yes\n";
	if(ex)exit(0);
}
void YES(bool ex=true){
	cout<<"YES\n";
	if(ex)exit(0);
}
void No(bool ex=true){
	cout<<"No\n";
	if(ex)exit(0);
}
void NO(bool ex=true){
	cout<<"NO\n";
	if(ex)exit(0);
}
void orYes(bool x,bool ex=true){
	if(x)Yes(ex);
	else No(ex);
}
void orYES(bool x,bool ex=true){
	if(x)YES(ex);
	else NO(ex);
}
void Possible(bool ex=true){
	cout<<"Possible\n";
	if(ex)exit(0);
}
void POSSIBLE(bool ex=true){
	cout<<"POSSIBLE\n";
	if(ex)exit(0);
}
void Impossible(bool ex=true){
	cout<<"Impossible\n";
	if(ex)exit(0);
}
void IMPOSSIBLE(bool ex=true){
	cout<<"IMPOSSIBLE\n";
	if(ex)exit(0);
}
void orPossible(bool x,bool ex=true){
	if(x)Possible(ex);
	else Impossible(ex);
}
void orPOSSIBLE(bool x,bool ex=true){
	if(x)POSSIBLE(ex);
	else IMPOSSIBLE(ex);
}

int n,p[2];
vc<pi>d[200005];
vi g[2][400005];
vi x[2];
bool use[2][400000];
bool vis[2][400000];
int ch(int a,int b){
	return a*2*n+b;
}
pi rch(int a){
	return mp(a/(n*2),a%(2*n));
}
void dfs(int v,int k,int q){
	x[q].pb(v);
	vis[k][v]=true;
	for(auto &i:g[k][v]){
		if(!vis[k][i]){
			dfs(i,k,(q+1)%2);
		}
	}
}
int main(void){
	cin.tie(0);
	ios::sync_with_stdio(0);
	rep(i,600){
		rep(j,600){
			if(i*i+j*j<=200000){
				d[i*i+j*j].pb(mp(i,j));
				d[i*i+j*j].pb(mp(-i,j));
				d[i*i+j*j].pb(mp(i,-j));
				d[i*i+j*j].pb(mp(-i,-j));
			}
		}
	}
	cin>>n>>p[0]>>p[1];
	rep(i,n*2){
		rep(j,n*2){
			rep(k,2){
				for(auto &t:d[p[k]]){
					int ny=i+t.F,nx=j+t.S;
					if(0<=ny&&ny<n*2&&0<=nx&&nx<2*n){
						g[k][ch(i,j)].pb(ch(ny,nx));
					}
				}
			}
		}
	}
	rep(i,2*n){
		rep(j,2*n){
			rep(k,2){
				if(vis[k][ch(i,j)])continue;
				x[0].clear();
				x[1].clear();
				dfs(ch(i,j),k,0);
				int t=0;
				if(si(x[0])<si(x[1]))t=1;
				for(auto &l:x[t]){
					use[k][l]=true;
				}
			}
		}
	}
	int s=0;
	rep(i,n*2){
		rep(j,n*2){
			if(use[0][ch(i,j)]&&use[1][ch(i,j)]){
				cout<<i<<' '<<j<<endl;
				s++;
				if(s>=n*n)return 0;
			}
		}
	}
}


Measured memory_bytes: 131564