#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
const int mod = 1e9 + 7;
long long dp[maxn] = {0, 1, 2, 3, 5, 8};
int main() {
  for (int i = 6; i < maxn; i++) dp[i] = (dp[i - 1] + dp[i - 2]) % mod;
  int n, m;
  cin >> n >> m;
  cout << (2 * (dp[n] + dp[m] - 1)) % mod << endl;
  return 0;
}
