#include <bits/stdc++.h>
using namespace std;
long long int M = 1e9 + 7;
long long int inf = 1e18;
long long getpow(long long base, long long pow) {
  long long res = 1;
  base = base % M;
  while (pow > 0) {
    if (pow % 2 != 0) res = res * base;
    res = res % M;
    base = base * base;
    base = base % M;
    pow /= 2;
  }
  return res;
}
void swp(long long int *x, long long int *y) {
  long long int t = *x;
  *x = *y;
  *y = t;
}
void init(vector<long long int> &v, long long int n) {
  for (long long int i = 0; i < n; i++) {
    cin >> v[i];
  }
}
void print(vector<long long int> &v) {
  for (long long int i = 0; i < v.size(); i++) cout << v[i] << " ";
  cout << endl;
}
void initg(vector<vector<long long int> > &v, long long int m) {
  long long int i, x, y;
  for (i = 0; i < m; i++) {
    cin >> x >> y;
    v[x].push_back(y);
    v[y].push_back(x);
  }
}
long long getans(long long x) {
  x--;
  long long i, x1, ans = 0;
  for (i = 1; i <= x; i++) {
    x1 = x - i;
    x1 /= 3;
    ans = ans + getpow(2, x1 + 1);
    ans = ans % M;
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t1, n, m, ans, n1, i;
  t1 = 1;
  while (t1--) {
    cin >> n >> m;
    n1 = max(n, m);
    long long dp[100005];
    dp[1] = 2, dp[2] = 4, dp[3] = 6;
    for (i = 4; i <= n1; i++) {
      dp[i] = (dp[i - 3] * 2) % M;
    }
    ans = dp[n] + dp[m];
    ans = (ans - 2 + M) % M;
    ans = ans % M;
    cout << ans << endl;
  }
}
