#ifndef HIDDEN_IN_VS // 折りたたみ用

// 警告の抑制
#define _CRT_SECURE_NO_WARNINGS

// ライブラリの読み込み
#include <bits/stdc++.h>
using namespace std;

// 型名の短縮
using ll = long long; using ull = unsigned long long; // -2^63 ～ 2^63 = 9e18（int は -2^31 ～ 2^31 = 2e9）
using pii = pair<int, int>;	using pll = pair<ll, ll>;	using pil = pair<int, ll>;	using pli = pair<ll, int>;
using vi = vector<int>;		using vvi = vector<vi>;		using vvvi = vector<vvi>;	using vvvvi = vector<vvvi>;
using vl = vector<ll>;		using vvl = vector<vl>;		using vvvl = vector<vvl>;	using vvvvl = vector<vvvl>;
using vb = vector<bool>;	using vvb = vector<vb>;		using vvvb = vector<vvb>;
using vc = vector<char>;	using vvc = vector<vc>;		using vvvc = vector<vvc>;
using vd = vector<double>;	using vvd = vector<vd>;		using vvvd = vector<vvd>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;

// 定数の定義
const double PI = acos(-1);
int DX[4] = { 1, 0, -1, 0 }; // 4 近傍（下，右，上，左）
int DY[4] = { 0, 1, 0, -1 };
int INF = 1001001001; ll INFL = 4004004003094073385LL; // (int)INFL = INF, (int)(-INFL) = -INF;

// 入出力高速化
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;

// 汎用マクロの定義
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), (x)))
#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), (x)))
#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}
#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 から n-1 まで昇順
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s から t まで昇順
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s から t まで降順
#define repe(v, a) for(const auto& v : (a)) // a の全要素（変更不可能）
#define repea(v, a) for(auto& v : (a)) // a の全要素（変更可能）
#define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d ビット全探索（昇順）
#define repis(i, set) for(int i = lsb(set), bset##i = set; i < 32; bset##i -= 1 << i, i = lsb(bset##i)) // set の全要素（昇順）
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て（昇順）
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去
#define EXIT(a) {cout << (a) << endl; exit(0);} // 強制終了
#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) // 半開矩形内判定

// 汎用関数の定義
template <class T> inline ll powi(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新（更新されたら true を返す）
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新（更新されたら true を返す）
template <class T> inline int getb(T set, int i) { return (set >> i) & T(1); }
template <class T> inline T smod(T n, T m) { n %= m; if (n < 0) n += m; return n; } // 非負mod

// 演算子オーバーロード
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }

#endif // 折りたたみ用


#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;

#ifdef _MSC_VER
#include "localACL.hpp"
#endif

//using mint = modint998244353;
//using mint = static_modint<(int)1e9+7>;
using mint = modint; // mint::set_mod(m);

using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>; using pim = pair<int, mint>;
#endif


#ifdef _MSC_VER // 手元環境（Visual Studio）
#include "local.hpp"
#else // 提出用（gcc）
int mute_dump = 0;
int frac_print = 0;
#if __has_include(<atcoder/all>)
namespace atcoder {
	inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
	inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
}
#endif
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(ll n) { return __builtin_popcountll(n); }
inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : 32; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : 64; }
inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }
#define dump(...)
#define dumpel(v)
#define dump_math(v)
#define input_from_file(f)
#define output_to_file(f)
#define Assert(b) { if (!(b)) { vc MLE(1<<30); rep(i,9)cout<<MLE[i]; exit(0); } } // RE の代わりに MLE を出す
#endif


//【有理数】（の改変）
/*
* Frac<T>() : O(1)
*	0 で初期化する．
*	制約：T は int, ll, __int128, boost::multiprecision::int256_t 等
*
* Frac<T>(T num) : O(1)
*	num で初期化する．
*
* Frac<T>(T num, T dnm) : O(1)
*	num / dnm で初期化する（分母は自動的に正にする）
*
* a == b, a != b, a < b, a > b, a <= b, a >= b : O(1)
*	大小比較を行う（分母が共通の場合は積はとらない）
*
* a + b, a - b, a * b, a / b : O(1)
*	加減乗除を行う（和と差については，分母が共通の場合は積はとらない）
*	一方が整数でも構わない．複合代入演算子も使用可．
*
* reduction() : O(log min(num, dnm))
*	自身の約分を行う．
*
* together(Frac& a, Frac& b) : O(log min(a.dnm, b.dnm))
*	a と b を通分する．
*
* together(vector<Frac>& as) : O(|as| log dnm)
*	as を通分する．
*
* T floor() : O(1)
*	自身の floor を返す．
*
* T ceil() : O(1)
*	自身の ceil を返す．
*
* Frac absolute() : O(1)
*	自身の絶対値を返す．
*
* bool integerQ() : O(1)
*	自身が整数かを返す．
*/
template <class T = ll>
struct Frac {
	// 分子，分母
	T num, dnm;

	// コンストラクタ
	Frac() : num(0), dnm(1) {}
	Frac(T num) : num(num), dnm(1) {}
	Frac(T num_, T dnm_) : num(num_), dnm(dnm_) {
		// verify : https://atcoder.jp/contests/abc244/tasks/abc244_h

		Assert(dnm != 0);
		if (dnm < 0) { num *= -1; dnm *= -1; }
	}

	// 代入
	Frac(const Frac& b) = default;
	Frac& operator=(const Frac& b) = default;

	// キャスト
	operator double() const { return (double)num / (double)dnm; }

	// 比較
	bool operator==(const Frac& b) const {
		// 分母が等しいときはオーバーフロー防止のために掛け算はせず比較する．
		if (dnm == b.dnm) return num == b.num;
		return num * b.dnm == b.num * dnm;
	}
	bool operator!=(const Frac& b) const { return !(*this == b); }
	bool operator<(const Frac& b) const {
		// verify : https://atcoder.jp/contests/abc308/tasks/abc308_c

		// 分母が等しいときはオーバーフロー防止のために掛け算はせず比較する．
		if (dnm == b.dnm) return num < b.num;
		return (num * b.dnm < b.num * dnm);
	}
	bool operator>=(const Frac& b) const { return !(*this < b); }
	bool operator>(const Frac& b) const { return b < *this; }
	bool operator<=(const Frac& b) const { return !(*this > b); }

	// 整数との比較
	bool operator==(T b) const { return num == b * dnm; }
	bool operator!=(T b) const { return num != b * dnm; }
	bool operator<(T b) const { return num < b * dnm; }
	bool operator>=(T b) const { return num >= b * dnm; }
	bool operator>(T b) const { return num > b * dnm; }
	bool operator<=(T b) const { return num <= b * dnm; }
	friend bool operator==(T a, const Frac& b) { return a * b.dnm == b.num; }
	friend bool operator!=(T a, const Frac& b) { return a * b.dnm != b.num; }
	friend bool operator<(T a, const Frac& b) { return a * b.dnm < b.num; }
	friend bool operator>=(T a, const Frac& b) { return a * b.dnm >= b.num; }
	friend bool operator>(T a, const Frac& b) { return a * b.dnm > b.num; }
	friend bool operator<=(T a, const Frac& b) { return a * b.dnm <= b.num; }

	// 四則演算
	Frac& operator+=(const Frac& b) {
		// verify : https://www.codechef.com/problems/ARCTR

		// 分母が等しいときはオーバーフロー防止のために掛け算はせず加算する．
		if (dnm == b.dnm) num += b.num;
		else { num = num * b.dnm + b.num * dnm; dnm *= b.dnm; }
		return *this;
	}
	Frac& operator-=(const Frac& b) {
		// verify : https://www.codechef.com/problems/ARCTR

		// 分母が等しいときはオーバーフロー防止のために掛け算はせず加算する．
		if (dnm == b.dnm) num -= b.num;
		else { num = num * b.dnm - b.num * dnm; dnm *= b.dnm; }
		return *this;
	}
	Frac& operator*=(const Frac& b) { num *= b.num; dnm *= b.dnm; return *this; }
	Frac& operator/=(const Frac& b) {
		// verify : https://atcoder.jp/contests/abc301/tasks/abc301_g

		Assert(b.num != 0);
		num *= b.dnm; dnm *= b.num;
		if (dnm < 0) { num *= -1; dnm *= -1; }
		return *this;
	}
	Frac operator+(const Frac& b) const { Frac a = *this; return a += b; }
	Frac operator-(const Frac& b) const { Frac a = *this; return a -= b; }
	Frac operator*(const Frac& b) const { Frac a = *this; return a *= b; }
	Frac operator/(const Frac& b) const { Frac a = *this; return a /= b; }
	Frac operator+() const { return Frac(*this); }
	Frac operator-() const { return Frac(*this) *= Frac(-1); }

	// 整数との四則演算
	Frac& operator+=(T c) { num += dnm * c; return *this; }
	Frac& operator-=(T c) { num -= dnm * c; return *this; }
	Frac& operator*=(T c) { num *= c; return *this; }
	Frac& operator/=(T c) {
		Assert(c != T(0));
		dnm *= c;
		if (dnm < 0) { num *= -1; dnm *= -1; }
		return *this;
	}
	Frac operator+(T c) const { Frac a = *this; return a += c; }
	Frac operator-(T c) const { Frac a = *this; return a -= c; }
	Frac operator*(T c) const { Frac a = *this; return a *= c; }
	Frac operator/(T c) const { Frac a = *this; return a /= c; }
	friend Frac operator+(T c, const Frac& a) { return a + c; }
	friend Frac operator-(T c, const Frac& a) { return Frac(c) - a; }
	friend Frac operator*(T c, const Frac& a) { return a * c; }
	friend Frac operator/(T c, const Frac& a) { return Frac(c) / a; }

	// 約分を行う．
	void reduction() {
		// verify : https://atcoder.jp/contests/abc229/tasks/abc229_h

		auto g = gcd(num, dnm);
		//auto g = boost::math::gcd(num, dnm);
		num /= g; dnm /= g;
	}

#ifdef _MSC_VER
	friend ostream& operator<<(ostream& os, const Frac& a) { os << a.num << '/' << a.dnm; return os; }
#endif
};


//【座標圧縮】O(n log n)
/*
* a[0..n) を座標圧縮した結果を a_cp[0..n) に格納し，その値域の大きさを返す．
* また xs[j] に圧縮された座標 j に対応する元の座標を格納する．
*
* a に重複する要素がなければ，a_cp[i] は a[i] が昇順で何番目かを表し，
* xs[j] は昇順で j 番目の要素が何かを表す．
*/
template <class T>
int coordinate_compression(const vector<T>& a, vi& a_cp, vector<T>* xs = nullptr) {
	// verify : https://atcoder.jp/contests/tessoku-book/tasks/tessoku_book_o

	int n = sz(a);
	if (xs == nullptr) xs = new vector<T>;

	// *xs : a の x 座標のユニークな昇順列
	*xs = a;
	uniq(*xs);

	// a[i] が xs において何番目かを求める．
	a_cp.resize(n);
	rep(i, n) a_cp[i] = lbpos(*xs, a[i]);

	return sz(*xs);
}


// i=n, j=m に対する愚直解を返す．
mint naive_nm(int n, int m) {
	mint res;

	return res;
}


// i=n に対する愚直解を返す．
vl naive_n(int n) {
	using F = Frac<__int128>;
	using vF = vector<F>;

	map<string, int> nxt;

	auto to_str = [&](vi a) {
		string s;
		repe(x, a) {
			if (x > 1000) s += "+";
			else if (x < -1000) s += "-";
			else s += "0";
		}
		return s;
	};

	function<vF(vi, int)> rf = [&](vi a, int k) {
		string s = to_str(a);

		if (k == n) {
			vi a_cp;
			coordinate_compression(a, a_cp);

			vF f(n);
			rep(i, n) f[i] = F(n - a_cp[i]);

//			dump("a:", a, "k:", k, "f:", f);

			return f;
		}

		a.push_back((int)1e9 - k - 1);
		vF fP = rf(a, k + 1);
		a.pop_back();

		a.push_back(-(int)1e9 - k - 1);
		vF fN = rf(a, k + 1);
		a.pop_back();

		a.push_back(0 - k - 1);
		vF f0 = rf(a, k + 1);
		a.pop_back();

		vF f1(n);
		rep(i, n) f1[i] = (fP[i] + fN[i]) / F(2);

		vF f;
		if (f0[k] == f1[k]) {
			nxt[s] = 2;

			f.resize(n);
			rep(i, n) f[i] = (f0[i] + f1[i]) / F(2);
		}
		else if (f0[k] < f1[k]) {
			nxt[s] = 0;

			f = move(f0);
		}
		else {
			nxt[s] = 1;

			f = move(f1);
		}
		rep(i, n) f[i].reduction();

//		dump("a:", a, "k:", k, "f:", f);

		return f;
	};
	vF f = rf(vi(), 0);
//	dump(f);

	vl res(n);
	rep(i, n) {
		f[i] *= powi(2, 2 * n - 2 - i);
		res[i] = (ll)(f[i].num / f[i].dnm);
	}

//	dumpel(nxt);

	int cnt2 = 0;
	function<void(vi, int)> rf2 = [&](vi a, int k) {
		cnt2++;

		string s = to_str(a);
		//		dump(s, nxt[s]);

		if (k == n) {
			return;
		}

		if (nxt[s] == 2) {
			a.push_back((int)1e9 - k - 1);
			rf2(a, k + 1);
			a.pop_back();

			a.push_back(-(int)1e9 - k - 1);
			rf2(a, k + 1);
			a.pop_back();

			a.push_back(0 - k - 1);
			rf2(a, k + 1);
			a.pop_back();
		}
		else if (nxt[s] == 0) {
			a.push_back(0 - k - 1);
			rf2(a, k + 1);
			a.pop_back();
		}
		else {
			a.push_back((int)1e9 - k - 1);
			rf2(a, k + 1);
			a.pop_back();

			a.push_back(-(int)1e9 - k - 1);
			rf2(a, k + 1);
			a.pop_back();
		}
	};
	rf2(vi(), 0);

	//	dump("cnt2:", cnt2);

	return res;
}


// (i,j)∈[0..n)×[0..m) に対する愚直解を返す．
vvm naive() {
	int N = 17;
//	vvm tbl;

	//vvm tbl(N, vm(N));
	//rep(i, N) rep(j, N) tbl[i][j] = naive_nm(i, j);

	vvl tblL(N);
	rep(i, N) {
		dump("i:", i);
		tblL[i] = naive_n(i);
	}
	dump_math(tblL);

	vvm tbl(sz(tblL));
	rep(i, sz(tblL)) {
		tbl[i].resize(sz(tblL[i]));
		rep(j, sz(tblL[i])) tbl[i][j] = tblL[i][j];
	}

#ifdef _MSC_VER
	// 埋め込み用
	string eb;
	eb += "vvm tbl = {\n";
	rep(i, sz(tbl)) {
		eb += "{";
		rep(j, sz(tbl[i])) eb += to_string(tbl[i][j].val()) + ",";
		if (eb.back() == ',') eb.pop_back();
		eb += "},\n";
	}
	eb.pop_back(); eb.pop_back();
	eb += "};\n\n";
	cout << eb;
#endif

	return tbl;
}


//【行列】
template <class T>
struct Matrix {
	int n, m; // 行列のサイズ（n 行 m 列）
	vector<vector<T>> v; // 行列の成分

	// n×m 零行列で初期化する．
	Matrix(int n, int m) : n(n), m(m), v(n, vector<T>(m)) {}

	// n×n 単位行列で初期化する．
	Matrix(int n) : n(n), m(n), v(n, vector<T>(n)) { rep(i, n) v[i][i] = T(1); }

	// 二次元配列 a[0..n)[0..m) の要素で初期化する．
	Matrix(const vector<vector<T>>& a) : n(sz(a)), m(sz(a[0])), v(a) {}
	Matrix() : n(0), m(0) {}

	// 代入
	Matrix(const Matrix&) = default;
	Matrix& operator=(const Matrix&) = default;

	// アクセス
	inline vector<T> const& operator[](int i) const { return v[i]; }
	inline vector<T>& operator[](int i) {return v[i];}

	// 入力
	friend istream& operator>>(istream& is, Matrix& a) {
		rep(i, a.n) rep(j, a.m) is >> a.v[i][j];
		return is;
	}

	// 行の追加
	void push_back(const vector<T>& a) {
		Assert(sz(a) == m);
		v.push_back(a);
		n++;
	}

	// 行の削除
	void pop_back() {
		Assert(n > 0);
		v.pop_back();
		n--;
	}

	// サイズ変更
	void resize(int n_) {
		v.resize(n_);
		n = n_;
	}

	void resize(int n_, int m_) {
		n = n_;
		m = m_;

		v.resize(n);
		rep(i, n) v[i].resize(m);
	}

	// 空か
	bool empty() const { return min(n, m) == 0; }

	// 比較
	bool operator==(const Matrix& b) const { return n == b.n && m == b.m && v == b.v; }
	bool operator!=(const Matrix& b) const { return !(*this == b); }

	// 加算，減算，スカラー倍
	Matrix& operator+=(const Matrix& b) {
		rep(i, n) rep(j, m) v[i][j] += b[i][j];
		return *this;
	}
	Matrix& operator-=(const Matrix& b) {
		rep(i, n) rep(j, m) v[i][j] -= b[i][j];
		return *this;
	}
	Matrix& operator*=(const T& c) {
		rep(i, n) rep(j, m) v[i][j] *= c;
		return *this;
	}
	Matrix operator+(const Matrix& b) const { return Matrix(*this) += b; }
	Matrix operator-(const Matrix& b) const { return Matrix(*this) -= b; }
	Matrix operator*(const T& c) const { return Matrix(*this) *= c; }
	friend Matrix operator*(const T& c, const Matrix<T>& a) { return a * c; }
	Matrix operator-() const { return Matrix(*this) *= T(-1); }

	// 行列ベクトル積 : O(m n)
	vector<T> operator*(const vector<T>& x) const {
		vector<T> y(n);
		rep(i, n) rep(j, m)	y[i] += v[i][j] * x[j];
		return y;
	}

	// ベクトル行列積 : O(m n)
	friend vector<T> operator*(const vector<T>& x, const Matrix& a) {
		vector<T> y(a.m);
		rep(i, a.n) rep(j, a.m) y[j] += x[i] * a[i][j];
		return y;
	}

	// 積：O(n^3)
	Matrix operator*(const Matrix& b) const {
		Matrix res(n, b.m);
		rep(i, res.n) rep(k, m) rep(j, res.m) res[i][j] += v[i][k] * b[k][j];
		return res;
	}
	Matrix& operator*=(const Matrix& b) { *this = *this * b; return *this; }

	// 累乗：O(n^3 log d)
	Matrix pow(ll d) const {
		Matrix res(n), pow2 = *this;
		while (d > 0) {
			if (d & 1) res *= pow2;
			pow2 *= pow2;
			d >>= 1;
		}
		return res;
	}

#ifdef _MSC_VER
	friend ostream& operator<<(ostream& os, const Matrix& a) {
		rep(i, a.n) {
			os << "[";
			rep(j, a.m) os << a[i][j] << " ]"[j == a.m - 1];
			if (i < a.n - 1) os << "\n";
		}
		return os;
	}
#endif
};


//【線形方程式】O(n m min(n, m))
template <class T>
vector<T> gauss_jordan_elimination(const Matrix<T>& A, const vector<T>& b, vector<vector<T>>* xs = nullptr) {
	int n = A.n, m = A.m;

	// v : 拡大係数行列 (A | b)
	vector<vector<T>> v(n, vector<T>(m + 1));
	rep(i, n) rep(j, m) v[i][j] = A[i][j];
	rep(i, n) v[i][m] = b[i];

	// pivots[i] : 第 i 行のピボットが第何列にあるか
	vi pivots;

	// 注目位置を v[i][j] とする．
	int i = 0, j = 0;

	while (i < n && j <= m) {
		// 注目列の下方の行から非 0 成分を見つける．
		int i2 = i;
		while (i2 < n && v[i2][j] == T(0)) i2++;

		// 見つからなかったら注目位置を右に移す．
		if (i2 == n) { j++; continue; }

		// 見つかったら第 i 行とその行を入れ替える．
		if (i != i2) swap(v[i], v[i2]);

		// v[i][j] をピボットに選択する．
		pivots.push_back(j);

		// v[i][j] が 1 になるよう第 i 行全体を v[i][j] で割る．
		T vij_inv = T(1) / v[i][j];
		repi(j2, j, m) v[i][j2] *= vij_inv;

		// 第 i 行以外の第 j 列の成分が全て 0 になるよう第 i 行を定数倍して減じる．
		rep(i2, n) {
			if (v[i2][j] == T(0) || i2 == i) continue;

			T mul = v[i2][j];
			repi(j2, j, m) v[i2][j2] -= v[i][j2] * mul;
		}

		// 注目位置を右下に移す．
		i++; j++;
	}

	// 最後に見つかったピボットの位置が第 m 列ならば解なし．
	if (!pivots.empty() && pivots.back() == m) return vector<T>();

	// A x = b の特殊解 x0 の構成（任意定数は全て 0 にする）
	vector<T> x0(m);
	int rnk = sz(pivots);
	rep(i, rnk) x0[pivots[i]] = v[i][m];

	// 同次形 A x = 0 の一般解 {x} の基底の構成（任意定数を 1-hot にする）
	if (xs != nullptr) {
		xs->clear();

		int i = 0;
		rep(j, m) {
			if (i < rnk && j == pivots[i]) {
				i++;
				continue;
			}

			vector<T> x(m);
			x[j] = T(1);
			rep(i2, i) x[pivots[i2]] = -v[i2][j];
			xs->emplace_back(move(x));
		}
	}

	return x0;
}


// https://qiita.com/satoshin_astonish/items/a628ec64f29e77501d07
namespace satoshin {
	/* 内積 */
	double dot(const vl& x, const vd& y) {
		double z = 0.0;
		const int n = sz(x);
		for (int i = 0; i < n; ++i) z += x[i] * y[i];
		return z;
	}
	double dot(const vd& x, const vd& y) {
		double z = 0.0;
		const int n = sz(x);
		for (int i = 0; i < n; ++i) z += x[i] * y[i];
		return z;
	}
	double dot(const vl& x, const vl& y) {
		double z = 0.0;
		const int n = sz(x);
		for (int i = 0; i < n; ++i) z += x[i] * y[i];
		return z;
	}

	/* Gram-Schmidtの直交化 */
	tuple<vd, vvd> Gram_Schmidt_squared(const vvl& b) {
		const int n = sz(b), m = sz(b[0]); int i, j, k;
		vd B(n);
		vvd GSOb(n, vd(m)), mu(n, vd(n));
		for (i = 0; i < n; ++i) {
			mu[i][i] = 1.0;
			for (j = 0; j < m; ++j) GSOb[i][j] = (double)b[i][j];
			for (j = 0; j < i; ++j) {
				mu[i][j] = dot(b[i], GSOb[j]) / dot(GSOb[j], GSOb[j]);
				for (k = 0; k < m; ++k) GSOb[i][k] -= mu[i][j] * GSOb[j][k];
			}
			B[i] = dot(GSOb[i], GSOb[i]);
		}
		return std::forward_as_tuple(B, mu);
	}

	/* 部分サイズ基底簡約 */
	void SizeReduce(vvl& b, vvd& mu, const int i, const int j) {
		ll q;
		const int m = sz(b[0]);
		if (mu[i][j] > 0.5 || mu[i][j] < -0.5) {
			q = (ll)round(mu[i][j]);
			for (int k = 0; k < m; ++k) b[i][k] -= q * b[j][k];
			for (int k = 0; k <= j; ++k) mu[i][k] -= mu[j][k] * q;
		}
	}

	/* LLL基底簡約 */
	void LLLReduce(vvl& b, const float d = 0.99) {
		const int n = sz(b), m = sz(b[0]); int j, i, h;
		double t, nu, BB, C;
		auto [B, mu] = Gram_Schmidt_squared(b);
		ll tmp;
		for (int k = 1; k < n;) {
			h = k - 1;

			for (j = h; j > -1; --j) SizeReduce(b, mu, k, j);

			//Checks if the lattice basis matrix b satisfies Lovasz condition.
			if (k > 0 && B[k] < (d - mu[k][h] * mu[k][h]) * B[h]) {
				for (i = 0; i < m; ++i) { tmp = b[h][i]; b[h][i] = b[k][i]; b[k][i] = tmp; }

				nu = mu[k][h]; BB = B[k] + nu * nu * B[h]; C = 1.0 / BB;
				mu[k][h] = nu * B[h] * C; B[k] *= B[h] * C; B[h] = BB;

				for (i = 0; i <= k - 2; ++i) {
					t = mu[h][i]; mu[h][i] = mu[k][i]; mu[k][i] = t;
				}
				for (i = k + 1; i < n; ++i) {
					t = mu[i][k]; mu[i][k] = mu[i][h] - nu * t;
					mu[i][h] = t + mu[k][h] * mu[i][k];
				}

				--k;
			}
			else ++k;
		}
	}
}


vl LLLReduce(const vvm& lat_) {
	int h = sz(lat_);
	int w = sz(lat_[0]);

	vvl lat(h + w, vl(w));
	rep(i, h) rep(j, w) lat[i][j] = lat_[i][j].val();
	rep(i, w) lat[h + i][i] = mint::mod();
	h = sz(lat);
	satoshin::LLLReduce(lat);

	// L1 ノルムをチェックする．
	ll sum = 0;
	rep(j, w) sum += abs(lat[0][j]);
	dump("L1:", sum);

	// L1 ノルムが大きいものは捨てる．
	repi(i, 1, h - 1) {
		ll sum2 = 0;
		rep(j, w) sum2 += abs(lat[i][j]);

		if (sum2 > sum * 10.) {
			lat.resize(i);
			h = i;
			break;
		}
	}
	dump("lat:"); frac_print = 1; dumpel(lat); frac_print = 0;

	return lat[0];
}


vl LLLReduce2(const vvm& xs) {
	int h = sz(xs);
	int w = sz(xs[0]);

	vl lat0(w);

#ifdef _MSC_VER
	string cmd;
	cmd += "wolframscript -code \"MOD=";
	cmd += to_string(mint::mod());
	cmd += ";";
	cmd += "SortBy[LatticeReduce@Join[{";
	rep(i, h) {
		cmd += "{";
		rep(j, w) {
			cmd += to_string(xs[i][j].val());
			cmd += ",";
		}
		if (cmd.back() == ',') cmd.pop_back();
		cmd += "},";
	}
	if (cmd.back() == ',') cmd.pop_back();
	cmd += "},MOD IdentityMatrix[";
	cmd += to_string(w);
	cmd += "]],N@Norm@# &]\"";
	dump("cmd:", cmd);

	FILE* fp = _popen(cmd.c_str(), "r");
	char buf[4096];
	while (fgets(buf, sizeof(buf), fp)) printf("%s", buf);
	_pclose(fp);

	stringstream ss{ buf + 2 };
	rep(j, w) {
		string s;
		getline(ss, s, ' ');
		lat0[j] = stol(s);
	}
	dump(lat0);
#endif

	return lat0;
}


string to_signed_string(mint x) {
	int v = x.val();
	int mod = mint::mod();
	if (v > mod / 2) v -= mod;
	return to_string(v);
}


// 変数係数線形漸化式の係数を計算し，埋め込み用のコードを出力する．
vvm embed_coefs_1D(const vm& seq, int TRM_ini = 1, int DEG_ini = 1, int LLL = 0) {
	int n = sz(seq);

	// TRM 項間の，係数多項式の次数 DEG 未満の変数係数線形漸化式
	//		Σt∈[0..TRM) Σd∈[0..DEG) coefs[t][d] (i-TRM+1+t)^d seq[i-t] = 0
	// を探す．
	int TRM = TRM_ini, DEG = DEG_ini;

	while (1) {
		//dump("TRM:", TRM, "DEG:", DEG);
		
		int h = n - TRM + 1;
		int w = TRM * DEG;

		// 行列方程式 A x = 0 を解いて一般解の基底 xs を求める．
		Matrix<mint> A(h, w);
		repi(i, TRM - 1, n - 1) {
			rep(t, TRM) rep(d, DEG) {
				A[i - TRM + 1][t * DEG + d] = mint(i - TRM + 1 + t).pow(d) * seq[i - t];
			}
		}
		
		vvm xs;
		gauss_jordan_elimination(A, vm(h), &xs);

		// 自明解 x = 0 しか存在しない場合は失敗．
		if (xs.empty()) {
			if (DEG == 1) {
				DEG = TRM + DEG;
				TRM = 1;
			}
			else {
				TRM++;
				DEG--;
			}
			continue;
		}

		dump("TRM:", TRM, "DEG:", DEG);
		dump("#eq:", h, "#var:", w);
		dump("xs:"); frac_print = 1; dumpel(xs); frac_print = 0;

		// 変数係数線形漸化式の係数
		vvm coefs(TRM, vm(DEG));

		if (LLL == 0) {
			rep(t, TRM) rep(d, DEG) coefs[t][d] = xs.back()[t * DEG + d];
		}
		else if (LLL == 1) {
			// A x = 0 の解空間の基底に LLL を適用する．
			auto lat0 = LLLReduce(xs);
			rep(t, TRM) rep(d, DEG) coefs[t][d] = lat0[t * DEG + d];
		}
		else if (LLL == 2) {
			// A x = 0 の解空間の基底に本気の LLL を適用する（埋め込み専用）
			auto lat0 = LLLReduce2(xs);
			rep(t, TRM) rep(d, DEG) coefs[t][d] = lat0[t * DEG + d];
		}

		// 分母チェック
#ifdef _MSC_VER
		cout << "dnm 1D:" << endl;
		string cmd;
		cmd += "wolframscript -code \"MOD=";
		cmd += to_string(mint::mod());
		cmd += ";";
		cmd += "toFrac[x_]:=Module[{},Do[num=Mod[x*dnm,MOD,-MOD/2];If[Abs[num]<=Sqrt@MOD,Return[num/dnm,Module]],{dnm,1,Sqrt@MOD}]];";
		cmd += "Factor[";
		rep(d, DEG) {
			cmd += to_string(coefs[0][d].val());
			cmd += "*(i-";
			cmd += to_string(TRM);
			cmd += "+1)^";
			cmd += to_string(d);
			cmd += "+";
		}
		cmd.pop_back();
		cmd += ",Modulus->MOD]/.x_Integer:>toFrac[x]\"";
		//dump("cmd:", cmd);

		FILE* fp = _popen(cmd.c_str(), "r");
		char buf[4096];
		while (fgets(buf, sizeof(buf), fp)) printf("%s", buf);
		_pclose(fp);
#endif

		return coefs;
	}

	return vvm();
}


// 変数係数線形漸化式の係数を計算し，埋め込み用のコードを出力する．
pair<vvvm, vvvm> embed_coefs_2D(const vvm& tbl, int DEG1_ini = 1, int TRM2_ini = 1, int DEG2_ini = 1, int LLL = 0) {
	int n1 = sz(tbl);

	// TRM 項間の，係数多項式の次数 DEG 未満の変数係数線形漸化式
	//		Σt1∈[0..TRM1) Σd1∈[0..DEG1) Σt2∈[0..TRM2) Σd2∈[0..DEG2)
	//			c[t1][d1][t2][d2] (i1-TRM1+1+t1)^d1 (i2-TRM2+1+t2)^d2 tbl[i1-t1][i2-t2] = 0
	// を探す．
	int TRM1 = 1, DEG1 = DEG1_ini;
	int TRM2 = TRM2_ini, DEG2 = DEG2_ini;
	int P_MAX = max({ TRM1, DEG1, TRM2, DEG2 });

	while (1) {
		//dump("TRM1:", TRM1, "DEG1:", DEG1, "TRM2:", TRM2, "DEG2:", DEG2);
		
		int w = TRM1 * DEG1 * TRM2 * DEG2;

		// 行列方程式 A x = 0 を解いて一般解の基底 xs を求める．
		Matrix<mint> A(0, w);
		repi(i1, TRM1 - 1, n1 - 1) {
			int n2 = sz(tbl[i1]);
			repi(i2, TRM2 - 1, n2 - 1) {
				vm a(w); bool valid = true;
				rep(t1, TRM1) rep(d1, DEG1) rep(t2, TRM2) rep(d2, DEG2) {
					if (i2 - t2 >= sz(tbl[i1 - t1])) {
						valid = false;
						break;
					}
					int idx = ((t1 * DEG1 + d1) * TRM2 + t2) * DEG2 + d2;
					mint pow_i = mint(i1 - TRM1 + 1 + t1).pow(d1) * mint(i2 - TRM2 + 1 + t2).pow(d2);
					a[idx] = pow_i * tbl[i1 - t1][i2 - t2];
				}
				if (valid) A.push_back(a);
			}
		}
		int h = A.n;
		
		vvm xs;
		gauss_jordan_elimination(A, vm(h), &xs);

		// 自明解 x = 0 しか存在しない場合は失敗．
		if (xs.empty()) {
			while (1) {
				DEG2++;
				if (DEG2 > P_MAX) { DEG2 = 1; TRM2++; };
				if (TRM2 > P_MAX) { TRM2 = 1; DEG1++; };
				if (DEG1 > P_MAX) { DEG1 = 1; TRM1++; };
				if (TRM1 > 1) { TRM1 = 1; P_MAX++; };
				if (max({ TRM1, DEG1, TRM2, DEG2 }) == P_MAX) break;
			}
			continue;
		}

		dump("TRM1:", TRM1, "DEG1:", DEG1, "TRM2:", TRM2, "DEG2:", DEG2);
		dump("#eq:", h, "#var:", w);
		dump("xs:"); frac_print = 1; dumpel(xs); frac_print = 0;

		// 変数係数線形漸化式の係数
		vvvm coefs(DEG1, vvm(TRM2, vm(DEG2)));

		if (LLL == 0) {
			rep(d1, DEG1) rep(t2, TRM2) rep(d2, DEG2) {
				int idx = (d1 * TRM2 + t2) * DEG2 + d2;
				coefs[d1][t2][d2] = xs.back()[idx];
			}
		}
		else if (LLL == 1) {
			// A x = 0 の解空間の基底に LLL を適用する．
			auto lat0 = LLLReduce(xs);
			rep(d1, DEG1) rep(t2, TRM2) rep(d2, DEG2) {
				int idx = (d1 * TRM2 + t2) * DEG2 + d2;
				coefs[d1][t2][d2] = lat0[idx];
			}
		}
		else if (LLL == 2) {
			// A x = 0 の解空間の基底に本気の LLL を適用する（埋め込み専用）
			auto lat0 = LLLReduce2(xs);
			rep(d1, DEG1) rep(t2, TRM2) rep(d2, DEG2) {
				int idx = (d1 * TRM2 + t2) * DEG2 + d2;
				coefs[d1][t2][d2] = lat0[idx];
			}
		}

		// 分母チェック
#ifdef _MSC_VER
		cout << "dnm 2D:" << endl;
		string cmd;
		cmd += "wolframscript -code \"MOD=";
		cmd += to_string(mint::mod());
		cmd += ";";
		cmd += "toFrac[x_]:=Module[{},Do[num=Mod[x*dnm,MOD,-MOD/2];If[Abs[num]<=Sqrt@MOD,Return[num/dnm,Module]],{dnm,1,Sqrt@MOD}]];";
		cmd += "Factor[";
		rep(d2, DEG2) {
			rep(d1, DEG1) {
				cmd += to_signed_string(coefs[d1][0][d2]);
				cmd += "*(i1-";
				cmd += to_string(TRM1);
				cmd += "+1)^";
				cmd += to_string(d1);
				cmd += "*(i2-";
				cmd += to_string(TRM2);
				cmd += "+1)^";
				cmd += to_string(d2);
				cmd += "+";
			}
		}
		cmd.pop_back();
		cmd += "]/.x_Integer:>toFrac[x]\"";
		//dump("cmd:", cmd);

		FILE* fp = _popen(cmd.c_str(), "r");		
		char buf[4096];
		while (fgets(buf, sizeof(buf), fp)) printf("%s", buf);
		_pclose(fp);
#endif

		// i1 方向への初項の延長
		dump("------- embed_coefs_1D -------");
		vvvm coefs1(TRM2 - 1);
		rep(i2, TRM2 - 1) {
			dump("--- i2:", i2, "---");

			vm seq; int offset = 0;
			rep(i1, sz(tbl)) {
				if (sz(tbl[i1]) <= i2) {
					if (offset == i1) {
						offset = i1 + 1;
						continue;
					} 
					else {
						break;
					}
				}
				seq.emplace_back(tbl[i1][i2]);
			}
			coefs1[i2] = embed_coefs_1D(seq, 1, 1, LLL);
		}

#ifdef _MSC_VER
		// 埋め込み用の文字列を出力する．		
		string eb;
		eb += "\n";
		eb += "constexpr int TRM1 = ";
		eb += to_string(TRM1);
		eb += ";\n";
		eb += "constexpr int DEG1 = ";
		eb += to_string(DEG1);
		eb += ";\n";
		eb += "constexpr int TRM2 = ";
		eb += to_string(TRM2);
		eb += ";\n";
		eb += "constexpr int DEG2 = ";
		eb += to_string(DEG2);
		eb += ";\n\n";

		eb += "vvm coefs1[TRM2 - 1] = {\n";
		rep(i2, TRM2 - 1) {
			eb += "{";
			rep(t, sz(coefs1[i2])) {
				eb += "{";
				rep(d, sz(coefs1[i2][t])) {
					eb += to_signed_string(coefs1[i2][t][d]) + ",";
				}
				if (eb.back() == ',')eb.pop_back();
				eb += "},";
			}
			if (eb.back() == ',')eb.pop_back();
			eb += "},\n";
		}
		eb.pop_back(); eb.pop_back();
		eb += "};\n\n";

		eb += "mint coefs[DEG1][TRM2][DEG2] = {\n";
		rep(d1, DEG1) {
			eb += "{";
			rep(t2, TRM2) {
				eb += "{";
				rep(d2, DEG2) {
					eb += to_signed_string(coefs[d1][t2][d2]) + ",";
				}
				if (eb.back() == ',')eb.pop_back();
				eb += "},";
			}
			if (eb.back() == ',')eb.pop_back();
			eb += "},\n";
		}
		eb.pop_back(); eb.pop_back();
		eb += "};\n";
		cout << eb;
#endif

		return { coefs1, coefs };
	}

	return pair<vvvm, vvvm>();
}


// 数列 seq を延長して seq[0..N] にする．
void solve_1D(vm& seq, int N, vvm coefs) {
	int TRM = sz(coefs);
	int DEG = sz(coefs[0]);

	int n = sz(seq);
	seq.resize(N + 1);

	// TRM 項間の，係数多項式の次数 DEG 未満の変数係数線形漸化式
	//		Σt∈[0..TRM) Σd∈[0..DEG) coefs[t][f] (i-TRM+1+t)^d a[i-t] = 0
	// を用いて数列 a を延長する．
	repi(i, n, N) {
		mint dnm = 0;
		mint pow_i = 1;
		rep(d, DEG) {
			dnm += coefs[0][d] * pow_i;
			pow_i *= i - TRM + 1;
		}

		mint num = 0;
		repi(t, 1, TRM - 1) {
			mint pow_i = 1;
			rep(d, DEG) {
				num += coefs[t][d] * pow_i * seq[i - t];
				pow_i *= i - TRM + 1 + t;
			}
		}

		// dnm * a[i] + num = 0 を解く．分母 0 に注意！
		if (dnm == 0) {
			dump("DIVISION BY ZERO at i =", i);
			Assert(dnm != 0);
		}
		seq[i] = -num / dnm;
	}
}


// 2 次元数列 tbl を元に seq = tbl[N][0..M] を計算する．
vm solve_2D(const vvm& tbl, int N, int M, vvvm coefs1, vvvm coefs) {
	int TRM1 = 1;
	int DEG1 = sz(coefs);
	int TRM2 = sz(coefs[0]);
	int DEG2 = sz(coefs[0][0]);
	
	vm res(TRM2 - 1);

	// i1 方向に tbl[..][0], ..., tbl[..][TRM2-2] を延長する．
	dump("------- solve_1D -------");
	rep(i2, TRM2 - 1) {
		dump("--- i2:", i2, "---");

		vm seq; int offset = 0;
		rep(i1, sz(tbl)) {
			if (sz(tbl[i1]) <= i2) {
				if (offset == i1) {
					offset = i1 + 1;
					continue;
				}
				else {
					break;
				}
			}
			seq.emplace_back(tbl[i1][i2]);
		}
		if (N - offset < 0) continue;

		solve_1D(seq, N - offset, coefs1[i2]);
		//dump("seq:", seq);

		res[i2] = seq[N - offset];
	}

	vm pow_i1s(DEG1);
	pow_i1s[0] = 1;
	repi(d1, 1, DEG1 - 1) pow_i1s[d1] = pow_i1s[d1 - 1] * (N - TRM1 + 1);

	// i2 方向に tbl[N][..] を延長する．
	res.resize(M + 1);
	repi(i2, TRM2 - 1, M) {
		mint dnm = 0;
		mint pow_i2 = 1;
		rep(d2, DEG2) {
			rep(d1, DEG1) {
				dnm += coefs[d1][0][d2] * pow_i1s[d1] * pow_i2;
			}
			pow_i2 *= i2 - TRM2 + 1;
		}
		
		mint num = 0;
		repi(t2, 1, TRM2 - 1) {
			mint pow_i2 = 1;
			rep(d2, DEG2) {
				rep(d1, DEG1) {
					num += coefs[d1][t2][d2] * pow_i1s[d1] * pow_i2 * res[i2 - t2];
				}
				pow_i2 *= i2 - TRM2 + 1 + t2;
			}
		}

		// dnm * tbl[N][i2] + num = 0 を解く．分母 0 に注意！
		if (dnm == 0) {
			dump("DIVISION BY ZERO at i1 =", N, "i2 =", i2);
			Assert(dnm != 0);
		}
		res[i2] = -num / dnm;
	}

	return res;
}


// 2 次元数列 tbl を元に seq = tbl[N][0..M] を計算する．
vm solve_2D(const vvm& tbl, int N, int M) {
	// --------------- embed_coefs() からの出力を貼る ----------------
	constexpr int TRM1 = 1;
	constexpr int DEG1 = 5;
	constexpr int TRM2 = 6;
	constexpr int DEG2 = 5;

	vvm coefs1[TRM2 - 1] = {
	{{-1},{1}},
	{{0,-1},{1,1}},
	{{353896324,-364898285,-235075176},{-260379676,-163195714,235075175},{295952678,0,1}},
	{{-119964865,-358862056,250706527,-361636909},{-312011847,170041679,-164040150,361636908},{195144498,97572245,0,1}},
	{{-161725579,54671115,464800796},{-60125449,497171643,-496662753},{-33540394,83872351,31861956},{-149183378,-238615078,1}} };

	mint coefs[DEG1][TRM2][DEG2] = {
	{{-365098632,-92430035,471393166,-203346072,189481567},{-318883614,268047093,-277290099,-78565528,-240318085},{166374063,-378963127,-286533097,115537542,-365098629},{0,-332748117,-415935145,166374061,249561089},{0,-2,6,499122171,-499122175},{24,-50,35,-10,1}},
	{{-92430035,-55458021,388206137,-240318085,0},{268047093,443664155,-235696584,36972013,0},{-378963127,425178159,346612626,-462150163,0},{-332748117,166374063,-499122170,3,0},{-2,12,499122160,6,0},{-50,70,-30,4,0}},
	{{-18486007,-406692144,-240318085,0,0},{272668596,46215016,-341991121,0,0},{-120159038,374341636,-471393166,0,0},{-415935145,-499122170,-499122172,0,0},{6,499122160,9,0,0},{35,-30,6,0,0}},
	{{0,0,0,0,0},{203346072,240318085,0,0,0},{143266552,-18486006,0,0,0},{166374061,3,0,0,0},{499122171,6,0,0,0},{-10,4,0,0,0}},
	{{0,0,0,0,0},{240318085,0,0,0,0},{355855626,0,0,0,0},{249561089,0,0,0,0},{-499122175,0,0,0,0},{1,0,0,0,0}} };
	// --------------------------------------------------------------

	vm res(TRM2 - 1);

	// i1 方向に tbl[..][0], ..., tbl[..][TRM2-2] を延長する．
	dump("------- solve_1D -------");
	rep(i2, TRM2 - 1) {
		dump("--- i2:", i2, "---");

		vm seq; int offset = 0;
		rep(i1, sz(tbl)) {
			if (sz(tbl[i1]) <= i2) {
				if (offset == i1) {
					offset = i1 + 1;
					continue;
				}
				else {
					break;
				}
			}
			seq.emplace_back(tbl[i1][i2]);
		}
		if (N - offset < 0) continue;
		
		solve_1D(seq, N - offset, coefs1[i2]);
		//dump("seq:", seq);

		res[i2] = seq[N - offset];
	}

	vm pow_i1s(DEG1);
	pow_i1s[0] = 1;
	repi(d1, 1, DEG1 - 1) pow_i1s[d1] = pow_i1s[d1 - 1] * (N - TRM1 + 1);

	// i2 方向に tbl[N][..] を延長する．
	res.resize(M + 1);
	repi(i2, TRM2 - 1, M) {
		mint dnm = 0;
		mint pow_i2 = 1;
		rep(d2, DEG2) {
			rep(d1, DEG1) {
				dnm += coefs[d1][0][d2] * pow_i1s[d1] * pow_i2;
			}
			pow_i2 *= i2 - TRM2 + 1;
		}

		mint num = 0;
		repi(t2, 1, TRM2 - 1) {
			mint pow_i2 = 1;
			rep(d2, DEG2) {
				rep(d1, DEG1) {
					num += coefs[d1][t2][d2] * pow_i1s[d1] * pow_i2 * res[i2 - t2];
				}
				pow_i2 *= i2 - TRM2 + 1 + t2;
			}
		}		

		// dnm * tbl[N][i2] + num = 0 を解く．分母 0 に注意！
		if (dnm == 0) {
			dump("DIVISION BY ZERO at i1 =", N, "i2 =", i2);
			Assert(dnm != 0);
		}
		res[i2] = -num / dnm;
	}

	return res;
}


vvl tblL = { {},{1},{6,3},{30,15,9},{142,71,43,23},{654,327,195,105,57},{2958,1479,867,465,255,135},{13198,6599,3811,2033,1111,593,313},{58254,29127,16611,8817,4791,2553,1359,711},{254862,127431,71907,38001,20535,10905,5799,3057,1593},{1106830,553415,309475,162929,87607,46361,24583,12953,6799,3527},{4776846,2388423,1325283,695409,372279,196377,103815,54585,28647,14961,7737},{20505486,10252743,5650659,2956401,1576503,829209,437127,229305,120135,62745,32655,16839},{87614350,43807175,24000739,12524657,6655543,3491609,1835911,960953,502471,262073,136423,70769,36409},{372827022,186413511,101595363,52894833,28020279,14665497,7693191,4018617,2097351,1092153,567879,294681,152463,78279},{1580786574,790393287,428751075,222764145,117673527,61458201,32170887,16773561,8739015,4543545,2359239,1223097,633063,326769,167481},{6681060238,3340530119,1804482787,935795825,493063735,257017625,134275975,69890489,36354247,18873401,9786823,5067833,2620999,1353497,697231,356807} };


int main() {
	input_from_file("input.txt");
//	output_to_file("output.txt");

	//【方法】
	// 愚直を書いて集めたデータをもとに変数係数線形漸化式を復元する．

	//【使い方】
	// 1. vm tbl = naive() を実装する．
	// 2. coefs = embed_coefs(tbl, TRM1_ini, DEG1_ini, TRM2_ini, DEG2_ini, LLL); を実行する．
	// 3. 出力を solve() 内に貼る．
	// 4. solve(tbl, n, m, [coefs]) で勝手に tbl[n][0..m] を求めてくれる．
	
	int n, p;
	cin >> n >> p;

	mint::set_mod(p);

	// 愚直解を用意する．再計算がイヤなら埋め込む．
//	auto tbl = naive();
	
	// 任意 mod 対策
	vvm tbl(sz(tblL));
	rep(i, sz(tblL)) {
		tbl[i].resize(sz(tblL[i]));
		rep(j, sz(tblL[i])) tbl[i][j] = tblL[i][j];
	}

	// 愚直解を渡して変数係数線形漸化式の係数を得る．再計算がイヤなら埋め込む．
	// 引数：tbl, DEG1_ini, TRM2_ini, DEG2_ini, LLL
	auto [coefs1, coefs] = embed_coefs_2D(tbl, 3, 1, 1, 0);

	// 2 次元数列 tbl を元に seq = tbl[n][0..m] を計算する．
	// 整理すると綺麗な式になるなら FullSimplify[] すると速くなる．
	auto res = solve_2D(tbl, n, n, coefs1, coefs);
	res.insert(res.begin(), 0);
//	auto seq = solve_2D(tbl, n, n);
	//dump(seq_h);
	
	mint inv2 = mint(2).inv();
	mint pow_inv2 = mint(inv2).pow(n - 1);
	repir(i, n, 1) {
		res[i] *= pow_inv2;
		pow_inv2 *= inv2;
	}
	//dump(res);

	repi(i, 1, n) cout << res[i] << " \n"[i == n];
	
}
/*
10 999999937

vvl tblL=
{{},{1},{6,3},{30,15,9},{142,71,43,23},{654,327,195,105,57},{2958,1479,867,465,255,135},{13198,6599,3811,2033,1111,593,313},{58254,29127,16611,8817,4791,2553,1359,711},{254862,127431,71907,38001,20535,10905,5799,3057,1593},{1106830,553415,309475,162929,87607,46361,24583,12953,6799,3527},{4776846,2388423,1325283,695409,372279,196377,103815,54585,28647,14961,7737},{20505486,10252743,5650659,2956401,1576503,829209,437127,229305,120135,62745,32655,16839},{87614350,43807175,24000739,12524657,6655543,3491609,1835911,960953,502471,262073,136423,70769,36409},{372827022,186413511,101595363,52894833,28020279,14665497,7693191,4018617,2097351,1092153,567879,294681,152463,78279},{1580786574,790393287,428751075,222764145,117673527,61458201,32170887,16773561,8739015,4543545,2359239,1223097,633063,326769,167481},{6681060238,3340530119,1804482787,935795825,493063735,257017625,134275975,69890489,36354247,18873401,9786823,5067833,2620999,1353497,697231,356807}};

vvm tbl = {
{},
{1},
{6,3},
{30,15,9},
{142,71,43,23},
{654,327,195,105,57},
{2958,1479,867,465,255,135},
{13198,6599,3811,2033,1111,593,313},
{58254,29127,16611,8817,4791,2553,1359,711},
{254862,127431,71907,38001,20535,10905,5799,3057,1593},
{1106830,553415,309475,162929,87607,46361,24583,12953,6799,3527},
{4776846,2388423,1325283,695409,372279,196377,103815,54585,28647,14961,7737},
{20505486,10252743,5650659,2956401,1576503,829209,437127,229305,120135,62745,32655,16839},
{87614350,43807175,24000739,12524657,6655543,3491609,1835911,960953,502471,262073,136423,70769,36409},
{372827022,186413511,101595363,52894833,28020279,14665497,7693191,4018617,2097351,1092153,567879,294681,152463,78279},
{580786637,790393287,428751075,222764145,117673527,61458201,32170887,16773561,8739015,4543545,2359239,1223097,633063,326769,167481},
{681060616,340530308,804482850,935795825,493063735,257017625,134275975,69890489,36354247,18873401,9786823,5067833,2620999,1353497,697231,356807}};

TRM1: 1 DEG1: 2 TRM2: 5 DEG2: 2
#eq: 78 #var: 20
xs:
 0: 32/3 4 -31/3 -5 -7/2 -15/2 11/3 5/2 -1/3 1 4 0 -5 0 -15/2 0 5/2 0 1 0
dnm 2D:
-16/3 + 4*i1 + 4*i2
------- embed_coefs_1D -------
--- i2: 0 ---
TRM: 3 DEG: 2
#eq: 14 #var: 6
xs:
 0: 5/4 1/4 -6 -5/4 4 1
dnm 1D:
(3 + i)/4
--- i2: 1 ---
TRM: 3 DEG: 2
#eq: 13 #var: 6
xs:
 0: 3/2 1/4 -29/4 -5/4 5 1
dnm 1D:
(4 + i)/4
--- i2: 2 ---
TRM: 3 DEG: 2
#eq: 12 #var: 6
xs:
 0: 17/8 1/4 -83/8 -5/4 15/2 1
dnm 1D:
(13/2 + i)/4
--- i2: 3 ---
TRM: 3 DEG: 2
#eq: 11 #var: 6
xs:
 0: 41/16 1/4 -201/16 -5/4 37/4 1
dnm 1D:
(33/4 + i)/4

constexpr int TRM1 = 1;
constexpr int DEG1 = 2;
constexpr int TRM2 = 5;
constexpr int DEG2 = 2;

vvm coefs1[TRM2 - 1] = {
{{-249999983,-249999984},{-6,249999983},{4,1}},
{{-499999967,-249999984},{249999977,249999983},{5,1}},
{{-124999990,-249999984},{374999966,249999983},{-499999961,1}},
{{437499975,-249999984},{-437499985,249999983},{-249999975,1}}};

mint coefs[DEG1][TRM2][DEG2] = {
{{333333323,4},{333333302,-5},{499999965,499999961},{333333316,-499999966},{333333312,1}},
{{4,0},{-5,0},{499999961,0},{-499999966,0},{1,0}}};

------- solve_1D -------
--- i2: 0 ---
--- i2: 1 ---
--- i2: 2 ---
--- i2: 3 ---
348579389 348579389 985794010 10223393 281799304 457885719 263916005 144042966 922851511 236328117
*/