#include <bits/stdc++.h>
using namespace std;
int find_peak(int a[], int n) {
  int l = 0, r = n - 1;
  while (l <= r) {
    int mid = l + (r - l) / 2;
    if ((mid == 0 || a[mid - 1] <= a[mid]) &&
        (a[mid + 1] <= a[mid] || mid == n - 1))
      return mid;
    else if (mid > 0 && a[mid - 1] > a[mid])
      r = mid - 1;
    else
      l = mid + 1;
  }
  return 0;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  int w, h;
  cin >> w >> h;
  long long int x = 1;
  while (w--) x = (2 * x) % 998244353;
  while (h--) x = (2 * x) % 998244353;
  cout << x;
  cout << "\n";
}
