#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

int p;

void updAdd(int& a, int b)
{
	a += b;
	if (a >= p)
		a -= p;
}

void updSub(int& a, int b)
{
	a -= b;
	if (a < 0)
		a += p;
}

int mult(int a, int b)
{
	return (LL)a * b % p;
}

complex<LL> mult(complex<LL> a, complex<LL> b)
{
	a *= b;
	a = {(a.real() % p + p) % p, (a.imag() % p + p) % p};
	return a;
}

complex<LL> binpow(complex<LL> a, LL n)
{
	complex<LL> res = {1, 0};
	while (n)
	{
		if (n & 1)
			res = mult(res, a);
		a = mult(a, a);
		n /= 2;
	}
	return res;
}

VI mult(VI a, VI b)
{
	VI c(SZ(a) + SZ(b) - 1);
	FOR(i, 0, SZ(a))
		FOR(j, 0, SZ(b))
			updAdd(c[i + j], mult(a[i], b[j]));
	return c;
}

pair<VI, VI> splitRealImag(int k, const VI& a)
{
	assert(SZ(a) == k + 1);
	VI resReal(k + 1), resImag(k + 1);
	FOR(i, 0, k + 1)
	{
		int r = (k - i) % 4;
		if (r == 0)
		{
			updAdd(resReal[i], a[i]);
		}
		else if (r == 1)
		{
			updAdd(resImag[i], a[i]);
		}
		else if (r == 2)
		{
			updSub(resReal[i], a[i]);
		}
		else
		{
			updSub(resImag[i], a[i]);
		}
	}
	return {resReal, resImag};
}

VI multipointEval(const VI& a, const VI& xs)
{
	VI res;
	for (int x : xs)
	{
		int y = 0, pw = 1;
		for (int ai : a)
		{
			updAdd(y, mult(ai, pw));
			pw = mult(pw, x);
		}
		res.PB(y);
	}
	return res;
}

vector<complex<LL>> f(int k)
{
	VI pol = {1};
	FOR(j, 0, k)
		pol = mult(pol, {j, 1});
	auto [polReal, polImag] = splitRealImag(k, pol);
	VI xs(p);
	iota(ALL(xs), 0);
	VI ysReal = multipointEval(polReal, xs);
	VI ysImag = multipointEval(polImag, xs);
	vector<complex<LL>> res(p);
	FOR(j, 0, p)
		res[j] = {ysReal[j], ysImag[j]};
	return res;
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	LL n;
	cin >> p >> n;
	vector<complex<LL>> f1 = f(p), f2 = f(n % p + 1);
	complex<LL> ans = {1, 0};
	FOR(j, 1, p)
		ans = mult(ans, complex<LL>(0, j));
	ans = binpow(ans, n / p);
	FOR(j, 1, n % p + 1)
	{
		ans = mult(ans, complex<LL>(0, j));
	}
	ans = binpow(ans, n / p + 1);
	FOR(x, 1, p)
	{
		if (x > n)
			break;
		ans = mult(ans, binpow(mult(binpow(f1[x], n / p), f2[x]), (n - x) / p + 1));
	}
	cout << ans.real() << " " << ans.imag() << "\n";
	return 0;
}