#include <bits/stdc++.h>

using namespace std;

//#define int int64_t

const int inf = 2e18;
//const int mod = 1e9 + 7;
const int mod = (1 << 30) + 1;

void ifmod(unsigned int& a) {
    if (a >= mod) {
        a -= mod;
    }
}

int32_t main() {
    freopen("m3.in", "r", stdin);
    freopen("m3.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n, m;
    cin >> n >> m;
    if (n < m) {
        swap(n, m);
    }
    vector<vector<unsigned int>> dp(m, vector<unsigned int>(1 << (m + 1)));
    dp[0][0] = 1;
    for (int i = 0; i < n; i++) {
        vector<vector<unsigned int>> new_dp(m, vector<unsigned int>(1 << (m + 1)));
        for (int j = 0; j < m; j++) {
            for (int mask = 0; mask < (1 << (m + 1)); mask++) {
                for (int b = 0; b < 2; b++) {
                    if (i == 0 || j == 0 || bool(mask & (1 << (j - 1))) != b ||
                                            bool(mask & (1 << j)) != b ||
                                            bool(mask & (1 << (j + 1))) != b) {
                        int new_mask = mask;
                        if (new_mask & (1 << j)) {
                            new_mask -= 1 << j;
                        }
                        if (b) {
                            new_mask += 1 << j;
                        }
                        if (j == m - 1) {
                            new_mask <<= 1;
                            new_mask &= (1 << (m + 1)) - 1;
                            ifmod(new_dp[0][new_mask] += dp[j][mask]);
                        } else {
                            ifmod(dp[j + 1][new_mask] += dp[j][mask]);
                        }
                    }
                }
            }
        }
        dp = new_dp;
    }
    unsigned int ans = 0;
    for (int mask = 0; mask < (1 << (m + 1)); mask++) {
        ifmod(ans += dp[0][mask]);
    }
    cout << ans;
}