#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
						For(j,m-1) cout<<a[i][j]<<' ';\
						cout<<a[i][m]<<endl; \
						} 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
inline int read()
{
	int x=0,f=1; char ch=getchar();
	while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
	while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
	return x*f;
} 
vector<pi > v;
ll calc(ll d) {
	for(ll i=0;i*i<=d;i++) {
		ll j=d-i*i;
		ll p=sqrt(j);
		if(p*p==j) {
			v.pb(mp(i,p));
		}
	}
}
int n;
#define MAXN (610)
bool vis[MAXN][MAXN]={};
bool inside(int i,int j) {return 0<=i&&i<2*n&&0<=j&&j<2*n;}
bool ok(int i,int j) {
	for(pi p:v) {
		int ni=i-p.fi,nj=j-p.se;
		if(inside(ni,nj)&& vis[ni][nj]) return 0;
		ni=i-p.fi,nj=j+p.se;
		if(inside(ni,nj)&& vis[ni][nj]) return 0;
		ni=i+p.fi,nj=j-p.se;
		if(inside(ni,nj)&& vis[ni][nj]) return 0;
		ni=i+p.fi,nj=j+p.se;
		if(inside(ni,nj)&& vis[ni][nj]) return 0;
		
	}
	return 1;
}
vector<pi > vp[2],vs;
int col[MAXN][MAXN]={};
void dfs(int i,int j,int c) {
	vp[c].pb(mp(i,j)); col[i][j]=c+1;
	for(pi p:v) {
		int ni=i-p.fi,nj=j-p.se;
		if(inside(ni,nj)&& !col[ni][nj]) dfs(ni,nj,c^1);
		ni=i-p.fi,nj=j+p.se;
		if(inside(ni,nj)&& !col[ni][nj]) dfs(ni,nj,c^1);
		ni=i+p.fi,nj=j-p.se;
		if(inside(ni,nj)&& !col[ni][nj]) dfs(ni,nj,c^1);
		ni=i+p.fi,nj=j+p.se;
		if(inside(ni,nj)&& !col[ni][nj]) dfs(ni,nj,c^1);
	}
	
}
int main()
{
//	freopen("D.in","r",stdin);
//	freopen(".out","w",stdout);
	n=read();
	ll d1=read(),d2=read();
	calc(d1);
	Rep(i,2*n) Rep(j,2*n) if(!col[i][j]) {
		Rep(k,2) vp[k].resize(0);
		dfs(i,j,0);	
		if(SI(vp[0])>SI(vp[1])) {
			for(pi p:vp[0]) vs.pb(p);
		}else {
			for(pi p:vp[1]) vs.pb(p);
		}
	}
	Rep(i,2*n) Rep(j,2*n) col[i][j]=1e5;
	v.resize(0); calc(d2);
	for(pi p : vs) col[p.fi][p.se]=0;
	
	vs.resize(0);
	Rep(i,2*n) Rep(j,2*n) if(!col[i][j]) {
		Rep(k,2) vp[k].resize(0);
		dfs(i,j,0);	
		if(SI(vp[0])>SI(vp[1])) {
			for(pi p:vp[0]) vs.pb(p);
		}else {
			for(pi p:vp[1]) vs.pb(p);
		}
	}
	vs.resize(n*n);
	for(pi p:vs) printf("%d %d\n",p.fi,p.se);

	return 0;
}


Measured memory_bytes: 46948