#ifndef CLASS_MODINT
#define CLASS_MODINT

#include <cstdint>

template <std::uint32_t mod>
class modint {
private:
	std::uint32_t n;
public:
	modint() : n(0) {};
	modint(std::int64_t n_) : n((n_ >= 0 ? n_ : mod - (-n_) % mod) % mod) {};
	static constexpr std::uint32_t get_mod() { return mod; }
	std::uint32_t get() const { return n; }
	bool operator==(const modint& m) const { return n == m.n; }
	bool operator!=(const modint& m) const { return n != m.n; }
	modint& operator+=(const modint& m) { n += m.n; n = (n < mod ? n : n - mod); return *this; }
	modint& operator-=(const modint& m) { n += mod - m.n; n = (n < mod ? n : n - mod); return *this; }
	modint& operator*=(const modint& m) { n = std::uint64_t(n) * m.n % mod; return *this; }
	modint operator+(const modint& m) const { return modint(*this) += m; }
	modint operator-(const modint& m) const { return modint(*this) -= m; }
	modint operator*(const modint& m) const { return modint(*this) *= m; }
	modint inv() const { return (*this).pow(mod - 2); }
	modint pow(std::uint64_t b) const {
		modint ans = 1, m = modint(*this);
		while (b) {
			if (b & 1) ans *= m;
			m *= m;
			b >>= 1;
		}
		return ans;
	}
};

#endif // CLASS_MODINT

#include <iostream>
using namespace std;
using mint = modint<998244353>;
mint calc(int N, int M) {
	mint p = mint(2).pow(M), mul = 1, ans = 1;
	for (int i = 0; i < N; ++i) {
		ans *= p - mul;
		mul *= 2;
	}
	return ans;
}
int main() {
	int N, M;
	cin >> N >> M;
	mint res1 = mint(2).pow(N);
	mint res2 = calc(N, M);
	mint res3 = calc(N, N);
	mint res4 = res2 * res3.inv();
	mint res5 = 1;
	for (int i = 1; i <= N; ++i) {
		res5 *= i;
	}
	mint res6 = res2 * res5.inv();
	cout << res1.get() << ' ' << res6.get() << ' ' << res4.get() << endl;
	return 0;
}