using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, m) = (c[0], c[1]);
        WriteLine(Xor(n, m));
    }
    static long Xor(int n, int m)
    {
        if (n == 0)
        {
            return 0;
        }
        var b = Bits(n);
        var mod = 998_244_353;
        var ans = 0L;
        if (m < 64)
        {
            var dp = new int[b.Count + m - 1];
            for (var i = 0; i < m; ++i) for (var j = 0; j < b.Count; ++j) dp[i + j] ^= b[j];
            var mul = 1L;
            for (var i = 0; i < dp.Length; ++i)
            {
                ans = (ans + dp[i] * mul % mod) % mod;
                mul = mul * 2 % mod;
            }
        }
        else
        {
            var tmp = 0L;
            var sub = 0L;
            var mul = 1L;
            for (var i = 0; i + 1 < b.Count; ++i)
            {
                tmp ^= b[i];
                sub = (sub + tmp * mul % mod) % mod;
                mul = mul * 2 % mod;
            }
            ans = sub;
            tmp ^= b[^1];
            var mul2 = Exp(2, m, mod);
            if (tmp == 1) ans = (ans + mul2 - mul + mod) % mod;
            tmp = 0;
            sub = 0;
            for (var i = b.Count - 1; i > 0; --i)
            {
                tmp ^= b[i];
                sub = (sub * 2 + tmp) % mod;
            }
            ans = (ans + sub * mul2 % mod) % mod;
        }
        return ans;
    }
    static List<int> Bits(int n)
    {
        var ans = new List<int>();
        while (n > 0)
        {
            ans.Add(n % 2);
            n >>= 1;
        }
        return ans;
    }
    static long Exp(long n, long p, int mod)
    {
        long _n = n % mod;
        var _p = p;
        var result = 1L;
        if ((_p & 1) == 1) result *= _n;
        while (_p > 0)
        {
            _n = _n * _n % mod;
            _p >>= 1;
            if ((_p & 1) == 1) result = result * _n % mod;
        }
        return result;
    }
}