#include <bits/stdc++.h>
 
//    #include <boost/multiprecision/cpp_int.hpp>
 #define int long long
 #define inf  1000000007
 #define pa pair<int,int>
 #define ll long long
 #define pal pair<double,double>
 #define ppap pair<pa,int>
  #define PI 3.14159265358979323846
  #define paa pair<int,char>
  #define  mp make_pair
  #define  pb push_back
  #define EPS (1e-10)
                                          
    int dx[8]={0,1,0,-1,1,1,-1,-1};
    int dy[8]={1,0,-1,0,-1,1,1,-1};
                                            using namespace std;
                                   			class pa3{
                                            	public:
                                            	int x;
                                   				int y,z;
                                            	pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}
                                            	bool operator < (const pa3 &p) const{
                                            		if(x!=p.x) return x<p.x;
                                            		if(y!=p.y) return y<p.y;
                                            		 return z<p.z;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                   				bool operator > (const pa3 &p) const{
                                            		if(x!=p.x) return x>p.x;
                                            		if(y!=p.y) return y>p.y;
                                            		 return z>p.z;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa3 &p) const{
                                            		return x==p.x && y==p.y && z==p.z;
                                            	}
                                            		bool operator != (const pa3 &p) const{
                                            			return !( x==p.x && y==p.y && z==p.z);
                                            	}
                                            
                                            };
                                            
                                            class pa4{
                                            	public:
                                            	int x;
                                            	int y,z,w;
                                            	pa4(int x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}
                                            	bool operator < (const pa4 &p) const{
                                            		if(x!=p.x) return x<p.x;
                                            		if(y!=p.y) return y<p.y;
                                            		if(z!=p.z)return z<p.z;
                                            		return w<p.w;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator > (const pa4 &p) const{
                                            		if(x!=p.x) return x>p.x;
                                            		if(y!=p.y) return y>p.y;
                                            		if(z!=p.z)return z>p.z;
                                            		return w>p.w;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa4 &p) const{
                                            		return x==p.x && y==p.y && z==p.z &&w==p.w;
                                            	}
                                            		
                                            
                                            };
                                            class pa2{
                                            	public:
                                            	int x,y;
                                            	pa2(int x=0,int y=0):x(x),y(y) {}
                                            	pa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}
                                            	pa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}
                                            	bool operator < (const pa2 &p) const{
                                            		return y != p.y ? y<p.y: x<p.x;
                                            	}
                                            	bool operator > (const pa2 &p) const{
                                            		return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa2 &p) const{
                                            		return abs(x-p.x)==0 && abs(y-p.y)==0;
                                            	}
                                            	bool operator != (const pa2 &p) const{
                                            		return !(abs(x-p.x)==0 && abs(y-p.y)==0);
                                            	}
                                            		
                                            
                                            };
                                            
 
                      
                                string itos( int i ) {
                                ostringstream s ;
                                s << i ;
                                return s.str() ;
                                }
                                 
                                int gcd(int v,int b){
                                	if(v>b) return gcd(b,v);
                                	if(v==b) return b;
                                	if(b%v==0) return v;
                                	return gcd(v,b%v);
                                }
                 
                            
                                int mod;
int extgcd(int a, int b, int &x, int &y) {
    if (b == 0) {
        x = 1;
        y = 0;
        return a;
    }
    int d = extgcd(b, a%b, y, x);
    y -= a/b * x;
    return d;
}
pa operator+(const pa & l,const pa & r) {   
    return {l.first+r.first,l.second+r.second};                                    
}    
pa operator-(const pa & l,const pa & r) {   
    return {l.first-r.first,l.second-r.second};                                    
}  
                                
                int pr[200010];
                int inv[200010];
                
                int beki(int wa,int rr,int warukazu){
                	if(rr==0) return 1%warukazu;
                	if(rr==1) return wa%warukazu;
                	wa%=warukazu;
                	if(rr%2==1) return ((ll)beki(wa,rr-1,warukazu)*(ll)wa)%warukazu;
                	ll zx=beki(wa,rr/2,warukazu);
                	return (zx*zx)%warukazu;
                }
 
                
    			int comb(int nn,int rr){
    				if(rr<0 || rr>nn || nn<0) return 0;
    				int r=pr[nn]*inv[rr];
    				r%=mod;
    				r*=inv[nn-rr];
    				r%=mod;
    				return r;
    			}
                
                void gya(int ert){
                	pr[0]=1;
                	for(int i=1;i<=ert;i++){
                		pr[i]=(pr[i-1]*i)%mod;
                	}
                		inv[ert]=beki(pr[ert],mod-2,mod);
                	for(int i=ert-1;i>=0;i--){
                		inv[i]=inv[i+1]*(i+1)%mod;
                	}
                }
                
              //   cin.tie(0);
    		//	ios::sync_with_stdio(false);
    			//priority_queue<pa3,vector<pa3>,greater<pa3>> pq;            
                 //sort(ve.begin(),ve.end(),greater<int>());
//    mt19937(clock_per_sec);
  //  mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()) ;
      
       
       
                               //----------------kokomade tenpure------------
int INF=inf*100000ll;
 	vector<int> xx[4],yy[4];
 	
 	vector<int> kiro[4][4][2];
 	
bool hikaku1(int x,int y){
	return abs(x)<abs(y);
}

bool hikaku2(int x,int y){
	return abs(x)>abs(y);
}
 	
int solve(int i,int j,int d){
	vector<int> v1=xx[i],v2=yy[j];
	if(v1.size()==1 && v1[0]==INF) return inf;
	if(v2.size()==1 && v2[0]==INF) return inf;
	if((int) abs((int) v2.size()-(int)v1.size())%2) return inf;
	
	
	while(v1.size()>v2.size()){
		v2.pb(d);
		v2.pb(-d);
	}
	
	while(v2.size()>v1.size()){
		v1.pb(d);
		v1.pb(-d);
	}
	
	int k1=0,k2=0;
	for(auto v:v1)if(abs(v)==d)k1++;
	for(auto v:v2)if(abs(v)==d)k2++;
	while(1){
		int h=v1.size();
		//[0,k1)
		//[h-k2,h)
	//	cout<<k1<<" "<<k2<<endl;
		if(k1<h-k2 || k1==0 || k2==0){
		v2.pb(d);
		v2.pb(-d);
		v1.pb(d);
		v1.pb(-d);
		k1+=2,k2+=2;
		}
		else break;
		
	}
	
	sort(v1.begin(),v1.end(),hikaku1);
	sort(v2.begin(),v2.end(),hikaku2);
	
	int e=v1.size();
	for(int k=0;k<e;k++){
	//	cout<<" "<<v1[k]<<" "<<v2[k]<<endl;
		if(abs(v1[k])!=d && abs(v2[k])!=d ) return inf;
	}
//	cout<<"d"<<endl;
	kiro[i][j][0]=v1;
	kiro[i][j][1]=v2;
	
	return e;
}	
 	
pair<vector<int>,vector<int> > gu(int x,int k){
	vector<int> ve[2];
 	if(x==0){
 		ve[1].pb(0);
 	}
 	else {
 		int X=abs(x);
 		int g=X/k;
 		for(int i=0;i<g;i++){
 			ve[0].pb(k);
 			ve[1].pb(k);
 			
 		}
 		
 		int ama=X%k;
 		if(ama){
 			ve[1].pb(ama);
 			ve[0].pb(k);
 			ve[0].pb(ama-k);
 			
 		}
 		else ve[0].pb(0);
 		if(x<0)for(auto &v:ve[0])v*=-1;		
 		if(x<0)for(auto &v:ve[1])v*=-1;
 	}	
	return mp(ve[0],ve[1]);
}	
 
vector<int> ki(int x,int k){
	vector<int> ve;
 	if(x==0){
 		return ve;
 	}
 	else {
 		int X=abs(x);
 		int g=X/k;
 		for(int i=0;i<g;i++){
 			ve.pb(k);
 		}
 		
 		int ama=X%k;
 		if(ama){
 			if(ama%2) ve.pb(ama);
 			else{
 				ve.pb(k);
 				ve.pb(ama-k);
 			}
 		}
 		if(x<0)for(auto &v:ve)v*=-1;
 	}	
	return ve;
}

pair<vector<int>,vector<int> > ch(int x,int k){
	
	if(k%2==0) return gu(x,k);
	else {
		vector<int> ve(1,INF);
		return mp(ki(x,k),ve);
	}
}
 signed main(){
 	
 
    	       cin.tie(0);
   		ios::sync_with_stdio(false);
int k,x,y;
 	cin>>k>>x>>y;
 	int X=(x+y),Y=(x-y);
 	
 		if(abs(x)+abs(y)==k){
 		cout<<1<<endl;
 			cout<<x<<" "<<y<<endl;
 			return 0;
 		}
 	if(k%2==0){
 		if((abs(x)+abs(y))%2)
 		{
 		cout<<-1<<endl;
 			return 0;
 		}
 	}
 	
 	//if(k%2==0) exit(1);
 	pair<vector<int>,vector<int> > xxx = ch(X,k);
 	pair<vector<int>,vector<int> > yyy = ch(Y,k);
 	
 	xx[0]=xxx.first;
 	xx[1]=xxx.second;
 	
 	yy[0]=yyy.first;
 	yy[1]=yyy.second;
 	/*
 	for(auto v:xx[0])cout<<v<<" ";
 	cout<<endl;
 	
 	for(auto v:xx[1])cout<<v<<" ";
 	cout<<endl;
 	
 	 for(auto v:yy[0])cout<<v<<" ";
 	cout<<endl;
 	
 	for(auto v:yy[1])cout<<v<<" ";
 	cout<<endl;
 	*/
 	int ii,jj,memo=inf;
 	
 	for(int i=0;i<2;i++)for(int j=0;j<2;j++){
 	//	cout<<i<<" "<<j<<endl;
 		int g=solve(i,j,k);
 	//	cout<<g<<endl;
 		if(memo>g){
 			memo=g;
 			ii=i,jj=j;
 		}
 	}
 //	cout<<ii<<" "<<jj<<endl;
 	vector<int> s=kiro[ii][jj][0],t=kiro[ii][jj][1];
 	
 	cout<<s.size()<<endl;
 	
 	int imax=0,imay =0;
 	for(int i=0;i<s.size();i++){
 		int px=(s[i]+t[i])/2;
 		int py=(s[i]-t[i])/2;
 		imax+=px;
 		imay +=py;
 		assert(abs(px)+abs(py)==k);
 		cout<<imax<<" "<<imay<<endl;
 	}
 	assert(imax==x && imay==y);
 	

 	return 0;
 	
 }

Measured memory_bytes: 11960