#include <iostream>
#include <algorithm>
#include <cmath>

using namespace std;

typedef long long ll;
const ll MOD = 998244353;
ll power(ll base, ll exp) {
    ll res = 1;
    base %= MOD;
    while (exp > 0) {
        if (exp % 2 == 1) {
            res = (res * base) % MOD;
        }
        base = (base * base) % MOD;
        exp /= 2;
    }
    return res;
}
ll modInverse(ll n) {
    // 5のモジュラ逆元を求める: 5^(MOD - 2) mod MOD
    return power(n, MOD - 2);
}

void solve() {
    ll N_val, K_val;
    if (!(cin >> N_val >> K_val)) return;
    ll required_length = 4 * N_val;
    if (K_val < required_length) {
        cout << 0 << endl;
        return;
    }
    ll inv_5 = modInverse(5);
    ll result = power(inv_5, required_length);

    cout << result << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    solve();

    return 0;
}