#include <bits/stdc++.h>
using namespace std;
bool sortinrev(long long x, long long y) { return x > y; }
void swap(long long* a, long long* b) {
  long long temp = *a;
  *a = *b;
  *b = temp;
}
long long div_ceil(long long a, long long b) { return (a + b - 1) / b; }
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; }
const int MOD = 1000 * 1000 * 1000 + 7;
const long long INF = 1e18L + 5;
const int nax = 200005;
const int N = int(1e6);
void solve() {
  long long n, m;
  cin >> n >> m;
  long long x = max(n, m);
  vector<long long> dp(x + 1);
  dp[0] = 1;
  dp[1] = 1;
  for (long long i = 2; i <= x; i++) dp[i] = (dp[i - 1] + dp[i - 2]) % MOD;
  cout << (2 * (dp[n] % MOD + dp[m] % MOD - 1)) % MOD << "\n";
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  long long T = 1;
  while (t--) {
    cerr << "TEST-CASE #" << T << "\n";
    solve();
    T++;
    cerr << "\n";
  }
  cerr << "\nI am Winning";
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
}
