#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;

int main(){
    int n,a,b;
    cin>>n>>a>>b;
    a = b - a;
    b = n*(n-1)/2-b;
    rep(p,n+1){
        rep(u,n+1){
            if(p+u>n||p*u>b)break;
            rep(r,n+1){
                if(p+u+r>n)break;
                if(r==0&&p*u!=b)continue;
                if(r!=0&&(b-p*u)%r)continue;
                rep(s,n+1){
                    if(p+u+r+s>n)break;
                    if(p*u+r*s!=b)continue;
                    if(p*u+r*s>b)break;
                    rep(t,n+1){
                        if(p+u+r+s+t>n)break;
                        int q = n-p-u-r-s-t;
                        if(p*u+r*s==b && (p+r)*t+(s+u)*q+p*r+s*u==a){
                            rep(_,p)cout<<"0 10"<<endl;
                            rep(_,q)cout<<"10 10"<<endl;
                            rep(_,r)cout<<"20 10"<<endl;
                            rep(_,s)cout<<"0 0"<<endl;
                            rep(_,t)cout<<"10 0"<<endl;
                            rep(_,u)cout<<"20 0"<<endl;
                            return 0;
                        }
                    }
                }
            }
        }
    }
    return 0;
}