#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (Y)-1;(X) >= (S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class T,size_t n> ostream& operator<<(ostream &os, const array<T,n> &t) {
	os<<"{"; rep(i,n) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class S, class T,class U> ostream& operator<<(ostream &os, const tuple<S,T,U> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class S, class T,class U,class V> ostream& operator<<(ostream &os, const tuple<S,T,U,V> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<","<<get<3>(t)<<")";}
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
//#undef NUIP
#ifdef NUIP
#define out(args...){vector<string> a_r_g_s=s_p_l_i_t(#args, ','); e_r_r(a_r_g_s.begin(), args); }
vector<string> s_p_l_i_t(const string &s, char c){vector<string> v;int d=0,f=0;string t;for(char c:s){if(!d&&c==',')v.pb(t),t="";else t+=c;if(c=='\"'||c=='\'')f^=1;if(!f&&c=='(')++d;if(!f&&c==')')--d;}v.pb(t);return move(v);}
void e_r_r(vector<string>::iterator it) {}
template<typename T, typename... Args> void e_r_r(vector<string>::iterator it, T a, Args... args){ if(*it==" 1"||*it=="1") cerr<<endl; else cerr << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << ", "; e_r_r(++it, args...);}
#else
#define out
#endif
#ifdef __cpp_init_captures
template<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}
template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}
#endif
const ll MOD=1e9+7;

int usd[666][666];
int cs[2][666][666];

int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
	int n,d0,d1;
	cin>>n>>d0>>d1;
	auto fun=[&](int d,int ii){
		fill(usd[0],usd[666],0);
		vector<pii> ban;
		rep(i,2*n)rep(j,2*n)if(i*i+j*j==d){
			ban.eb(i,j);
			ban.eb(i,-j);
			ban.eb(-i,j);
			ban.eb(-i,-j);
		}
		sort(all(ban)); UNIQUE(ban);
		rep(i,2*n)rep(j,2*n)if(MX(usd[i][j],1)){
			queue<pii> que; que.emplace(j,i);
			int x,y;
			while(que.size()){
				tie(x,y)=que.front(); que.pop();
				out(x,y,1);
				for(pii d:ban){
					int nx=x+d.X;
					int ny=y+d.Y;
				out(nx,ny,1);
					if(nx<0 || nx>=2*n || ny<0 || ny>=2*n) continue;
					if(MX(usd[ny][nx],1)){
						cs[ii][ny][nx]=1-cs[ii][y][x];
						que.emplace(nx,ny);
					}else assert(cs[ii][ny][nx]==1-cs[ii][y][x]);
				}
			}
		}
	};
	fun(d0,0); fun(d1,1);
	vector<pii> ps[2][2];
	rep(i,2*n)rep(j,2*n) ps[cs[0][i][j]][cs[1][i][j]].eb(j,i);
	int mx=-1,a,b;
	rep(i,2)rep(j,2)if(MX(mx,(int)ps[i][j].size())) a=i, b=j;
	rep(i,n*n){
		int x,y;
		tie(x,y)=ps[a][b][i];
		cout<<x<<" "<<y<<"\n";
	}
  return 0;
}


Measured memory_bytes: 9832