#include <atcoder/all>
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
using namespace atcoder;
using namespace std;
using mint = modint998244353;

mint modpow(ll a, ll b) {
    mint ans = 1;
    while (b) {
        if (b % 2 == 1) ans *= a;
        b /= 2;
        a *= a;
    }
    return ans;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);

    ll a, n;
    cin >> a >> n;

    cout << 998244353 << "\n";
    cout << modpow(a, n).val() << "\n";

    return 0;
}