/*
 * Source: gemini 2.5pro with prompt

╭───────────────────────────────────╮
│  > translate xiaowuc1.py to Java  │
╰───────────────────────────────────╯

*/
import java.util.Scanner;
import java.math.BigInteger;

public class xiaowuc1 {

    public static void solve() {
        Scanner sc = new Scanner(System.in);
        long n = sc.nextLong();
        long k = sc.nextLong();
        sc.close();

        long MOD = 998244353;

        BigInteger bigN = BigInteger.valueOf(n);
        BigInteger bigK = BigInteger.valueOf(k);
        BigInteger bigMOD = BigInteger.valueOf(MOD);

        BigInteger twoK = bigK.multiply(BigInteger.valueOf(2));
        BigInteger twoKplus1 = twoK.add(BigInteger.ONE);

        BigInteger exp = twoK;

        BigInteger numBase = twoK;
        BigInteger denBase = twoKplus1;

        BigInteger numerator = bigN.multiply(numBase.modPow(exp, bigMOD));
        BigInteger denominator = denBase.modPow(exp, bigMOD);

        BigInteger denInverse = denominator.modInverse(bigMOD);

        BigInteger result = numerator.multiply(denInverse).mod(bigMOD);

        System.out.println(result);
    }

    public static void main(String[] args) {
        solve();
    }
}