#include<iostream>
#include<fstream>
#include<iomanip>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cctype>
#include<vector>
#include<queue>
#include<deque>
#include<stack>
#include<cassert>
#include<algorithm>
#include<functional>
#include<ctime>
using namespace std;
ifstream fin("ariprog.in");
ofstream fout("ariprog.out");
class T
{
public:
	int a,b;
}t[130000]={0,0};
bool compare(class T A,class T B)
{
	if(A.b<B.b)return 1;
	return 0;
}
bool square[130000]={false},ok=false,mark=true;
int N,M,k=0,p,q;
int main()
{
	//Init
	fin>>N>>M;
	//生成双平方数列
	for(p=0;p<=M;p++)
	{
		for(q=0;q<=M;q++)square[p*p+q*q]=true;
	}
	//Search
	for(int a=0;a<=M;a++)
	{
		for(int b=1;b<=M;b++)
		{
			int i;
			for(int n=0;n<=N;n++)
			{
				if((a+n*b)>(p*p+q*q)){mark=false;break;}
				if(square[a+n*b]==true)i++;
				if(i==N){t[k].a=a;t[k].b=b;k++;ok=true;break;}
			}
			if(mark==false)break;
		}
	}
	k--;
	sort(t,t+k,compare);
	for(int i=0;i<k;i++)fout<<t[i].a<<" "<<t[i].b<<endl;
	if(ok==false)fout<<"NONE"<<endl;
	return 0;
}