#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 9_ten + 7;

vector<vector<int>> make_graph(int n, int d){
  int w = ceil( sqrt(d) );
  vector<vector<int>> g(n*n*4);
  vector<pair<int,int>> dxdy;
  {
    int x = 0, y = 0;
    for(int yy=max(-w, -2*n); yy<=min(w, 2*n); yy++){
      int dy = y-yy;
      int dx = d - dy*dy;
      if(dx < 0) continue;
      dx = sqrt(dx);
      if( dx*dx + dy*dy != d ) continue;
      int xx = x+dx;
      int u =  y*(2*n) +  x;

      if( -2*n <= xx && xx <= 2*n ){
        dxdy.emplace_back( dy, dx );
        if(dx != 0) dxdy.emplace_back( dy, -dx );
      }
    }
  }
  eprintln(dxdy.size());

  for(int y=0; y<2*n; y++) for(int x=0; x<2*n; x++){
    int u = y*(2*n) + x;

    for(auto dd : dxdy){
      int yy = y + dd.first;
      int xx = x + dd.second;

      if( 0<=yy && yy<2*n && 0<=xx && xx<2*n ){
        g[u].push_back( yy*(2*n) + xx );
      }
    }
    // for(int yy=0; yy<min(y+w+1, 2*n); yy++){
    //   int dy = y-yy;
    //   int dx = d - dy*dy;
    //   if(dx < 0) continue;
    //   dx = sqrt(dx);
    //   if( dx*dx + dy*dy != d ) continue;
    //   int xx = x+dx;
    //   int u =  y*(2*n) +  x;
    //   if( 0<=xx && xx<2*n ){
    //     int v = yy*(2*n) + xx;
    //     g[ u ].push_back( v );
    //     g[ v ].push_back( u );
    //   }
      // xx = x-dx;
      // if( dx!=0 && 0<=xx && xx<2*n ){
      //   int v = yy*(2*n) + xx;
      //   g[ u ].push_back( v );
      // }
    // }
  }

  return g;
}

pair<int,int> coloring(vector<vector<int>>& g, vector<int>& c, int pos, int color){
  c[pos] = color;
  pair<int,int> res( color==0, color==1 );
  for(int nx : g[pos]){
    if( c[nx] != -1 ) continue;
    auto tmp = coloring(g, c, nx, color^1);
    res.first += tmp.first;
    res.second += tmp.second;
  }
  return res;
}

int main(){
  int n, d1, d2;
  cin >> n, d1, d2;

  auto g1 = make_graph(n, d1);
  auto g2 = make_graph(n, d2);

  for(int i=0; i<g1.size(); i++){
    for(auto nx : g1[i]){
      assert( count(begin(g1[nx]), end(g1[nx]), i) );
    }
  }

  eprintln("---");

  vector<int> c1(n*n*4, -1), c2(n*n*4, -1);

  pair<int,int> p1, p2;
  for(int i=0; i<n*2; i++) for(int j=0; j<2*n; j++){
    if( c1[i*2*n + j] == -1 ){
      auto tmp = coloring(g1, c1, i*2*n + j, 0);
      p1.first += tmp.first;
      p1.second += tmp.second;
    }
    if( c2[i*2*n + j] == -1 ){
      auto tmp = coloring(g2, c2, i*2*n + j, 0);
      p2.first += tmp.first;
      p2.second += tmp.second;
    }
  }

  eprintln(p1, p2);

  vector<int> sum(1<<2, 0);
  for(int i=0; i<n*n*4; i++){
    sum[ (c1[i]<<1) | c2[i] ]++;
  }

  eprintln(sum);

  vector<pair<int,int>> ans;
  for(int x=0; x<(1<<2); x++){
    if( sum[x] >= n*n ){
      int rem = n*n;
      for(int i=0; i<n*n*4 && rem; i++){
        if( ((c1[i]<<1)|c2[i]) == x ){
          print(i/(2*n), i%(2*n));
          print("\n");

          ans.emplace_back(i/(2*n), i%(2*n));
          rem--;
        }
      }
      break;
    }
  }

  // for(int i=0; i<ans.size(); i++){
  //   for(int j=i+1; j<ans.size(); j++){
  //     int dx = ans[i].first - ans[j].first;
  //     int dy = ans[i].second - ans[j].second;
  //     int d = dx*dx + dy*dy;

  //     if( d==d1 || d==d2 ){
  //       eprintln( ans[i], ans[j] , d );
  //       assert( d!=d1 && d!=d2 );
  //     }

  //   }
  // }

  return 0;
}


Measured memory_bytes: 124924