For this Question: An array A of size N is called magical if:

1. Each element of the array is a positive integer not exceeding M, that is, 1 ≤ A<sub>i</sub> ≤ M for each i.
2. For each i such that 1 ≤ i ≤ N, define f(i) = A<sub>1</sub> | A<sub>2</sub> | ... A<sub>i</sub>, where x | y denotes the bitwise OR of x and y. Then, f(1) = f(2) = ... f(N) must hold.

Your task is to calculate the number of magical arrays of size N, modulo 998244353.The input consists of two space-separated integers N and M.

<b> Constraints: </b>
1 ≤ N ≤ 10<sup>5</sup>
1 ≤ M ≤ 10<sup>5</sup>Print a single integer – the number of magical arrays modulo 998244353.Sample Input 1:
2 3

Sample Output 1:
5

Sample Explanation:
The magical arrays are: [1, 1], [2, 2], [3, 3], [3, 1], [3, 2].

Sample Input 2:
1 50

Sample Output 2:
50

Sample Input 3:
707 707

Sample Output 3:
687062898, I have written this Solution Code: #include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
 
typedef long long ll;
typedef long double ld;
#define db(x) cerr << #x << ": " << x << '\n';
#define read(a) int a; cin >> a;
#define reads(s) string s; cin >> s;
#define readb(a, b) int a, b; cin >> a >> b;
#define readc(a, b, c) int a, b, c; cin >> a >> b >> c;
#define readarr(a, n) int a[(n) + 1] = {}; FOR(i, 1, (n)) {cin >> a[i];}
#define readmat(a, n, m) int a[n + 1][m + 1] = {}; FOR(i, 1, n) {FOR(j, 1, m) cin >> a[i][j];}
 
#define print(a) cout << a << endl;
#define printarr(a, n) FOR (i, 1, n) cout << a[i] << " "; cout << endl;
#define printv(v) for (int i: v) cout << i << " "; cout << endl;
#define printmat(a, n, m) FOR (i, 1, n) {FOR (j, 1, m) cout << a[i][j] << " "; cout << endl;}
#define all(v) v.begin(), v.end()
#define sz(v) (int)(v.size())
#define rz(v, n) v.resize((n) + 1);
#define pb push_back
#define fi first
#define se second
#define vi vector <int>
#define pi pair <int, int>
#define vpi vector <pi>
#define vvi vector <vi>
#define setprec cout << fixed << showpoint << setprecision(20);
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
const ll inf = 1e18;
const ll mod = 998244353;
const ll N = 2e5 + 1;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
int power (int a, int b = mod - 2)
{
    int res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return res;
}
 
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    
    readb(n, m);
    int ans = 0;
    FOR (i, 1, m)
    {
        int x = (1 << (__builtin_popcountll(i))) - 1;
        ans = (ans + power(x, n - 1)) % mod;
    }
    
    cout << ans;
}
 
 
 
 
 , In this Programming Language: C++, Now tell me if this Code is compilable or not?