#include<iostream>

#include<cstdio>

#include<algorithm>

#include<cstdlib>

#include<cstring>

#include<string>

#include<cmath>

#include<map>

#include<set>

#include<vector>

#include<queue>

#include<bitset>

#include<ctime>

#include<deque>

#include<stack>

#include<functional>

#include<sstream>

//#include<cctype>

//#pragma GCC optimize(2)

using namespace std;

#define maxn 200005

#define inf 0x7fffffff

//#define INF 1e18

#define rdint(x) scanf("%d",&x)

#define rdllt(x) scanf("%lld",&x)

#define rdult(x) scanf("%lu",&x)

#define rdlf(x) scanf("%lf",&x)

#define rdstr(x) scanf("%s",x)

typedef long long  ll;

typedef unsigned long long ull;

typedef unsigned int U;

#define ms(x) memset((x),0,sizeof(x))

const long long int mod = 1e9 + 7;

#define Mod 1000000000

#define sq(x) (x)*(x)

#define eps 1e-3

typedef pair<int, int> pii;

#define pi acos(-1.0)

//const int N = 1005;

#define REP(i,n) for(int i=0;i<(n);i++)

typedef pair<int, int> pii;

inline ll rd() {

	ll x = 0;

	char c = getchar();

	bool f = false;

	while (!isdigit(c)) {

		if (c == '-') f = true;

		c = getchar();

	}

	while (isdigit(c)) {

		x = (x << 1) + (x << 3) + (c ^ 48);

		c = getchar();

	}

	return f ? -x : x;

}

ll gcd(ll a, ll b) {

	return b == 0 ? a : gcd(b, a%b);

}

int sqr(int x) { return x * x; }

/*ll ans;

ll exgcd(ll a, ll b, ll &x, ll &y) {

	if (!b) {

		x = 1; y = 0; return a;

	}

	ans = exgcd(b, a%b, x, y);

	ll t = x; x = y; y = t - a / b * y;

	return ans;

}

*/

int n, m;

struct node {

	int a, b;

}nd[maxn];

bool cmp(node x, node y) {

	if (x.b < y.b)return true;

	if (x.b == y.b&&x.a < y.a)return true;

	return false;

}

int ans;

bool fg[maxn];

int main() {

	//ios::sync_with_stdio(0);

	rdint(n); rdint(m);

	for (int i = 0; i <= m; i++)

		for (int j = 0; j <= m; j++)fg[i*i + j * j] = true;

	int maxx = m * m * 2;

	for (int i = 0; i <= maxx; i++) {

		if (fg[i]) {

			for (int j = i + 1; j <= maxx; j++) {

				if (fg[j]) {

					int dt = j - i;

					int Max = i + dt * (n - 1);

					if (Max > maxx)break;

					bool f = true;

					for (int k = i + dt; k <= Max; k += dt) {

						if (!fg[k]) {

							f = false; break;

						}

					}

					if (f) {

						nd[++ans].a = i;

						nd[ans].b = dt;

					}

				}

			}

		}

	}

	if (ans == 0) {

		cout << "NONE" << endl;

	}

	else {

		sort(nd + 1, nd + 1 + ans, cmp);

		for (int i = 1; i <= ans; i++) {

			cout << nd[i].a << ' ' << nd[i].b << endl;

		}

	}

	return 0;

}