#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline bool upmin(T &x, T y) {
  return y < x ? x = y, 1 : 0;
}
template <typename T>
inline bool upmax(T &x, T y) {
  return x < y ? x = y, 1 : 0;
}
const long double eps = 1e-11;
const long double pi = acos(-1);
const int oo = 1 << 30;
const long long loo = 1ll << 62;
const int mods = 1e9 + 7;
const int MAXN = 200005;
const int INF = 0x3f3f3f3f;
inline int read() {
  int f = 1, x = 0;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = (x << 3) + (x << 1) + (c ^ 48);
    c = getchar();
  }
  return x * f;
}
int f[MAXN];
int upd(int x, int y) {
  return x + y >= mods ? x + y - mods : (x - y < 0 ? x + y + mods : x + y);
}
int main() {
  int n = read(), m = read();
  if (n > m) swap(n, m);
  f[1] = 1, f[2] = 2;
  for (int i = 3; i <= max(n, m); i++) f[i] = upd(f[i - 1], f[i - 2]);
  printf("%d\n", upd(upd(f[n], f[m] - 1), upd(f[n], f[m] - 1)));
  return 0;
}
