#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <class T>
using vv = vector<vector<T>>;
template <class T>
inline bool MX(T &l, const T &r) {
  return l < r ? l = r, 1 : 0;
}
template <class T>
inline bool MN(T &l, const T &r) {
  return l > r ? l = r, 1 : 0;
}
const ll MOD = 1e9 + 7;
ll modpow(ll r, ll n, ll m = MOD) {
  ll re = 1, d = r % m;
  if (n < 0) (n %= m - 1) += m - 1;
  for (; n; n /= 2) {
    if (n & 1) (re *= d) %= m;
    (d *= d) %= m;
  }
  return re;
}
template <int mod = MOD>
struct modInt {
  int v;
  modInt(int v = 0) : v(v) {}
  modInt(ll v) : v(v % MOD) {}
  modInt operator+(const modInt &n) const {
    return v + n.v < mod ? v + n.v : v + n.v - mod;
  }
  modInt operator-(const modInt &n) const {
    return v - n.v < 0 ? v - n.v + mod : v - n.v;
  }
  modInt operator*(const modInt &n) const { return ll(v) * n.v % mod; }
  modInt operator/(const modInt &n) const {
    return ll(v) * modpow(n.v % mod, -1, mod) % mod;
  }
  modInt operator+(const ll &n) const {
    return v + n < mod ? v + n : v + n - mod;
  }
  modInt operator-(const ll &n) const {
    return v - n < 0 ? v - n + mod : v - n;
  }
  modInt operator*(const ll &n) const { return ll(v) * (n % mod) % mod; }
  modInt operator/(const ll &n) const {
    return ll(v) * modpow(n % mod, -1, mod) % mod;
  }
  modInt &operator+=(const modInt &n) {
    v += n.v;
    if (v >= mod) v -= mod;
    return *this;
  }
  modInt &operator-=(const modInt &n) {
    v -= n.v;
    if (v < 0) v += mod;
    return *this;
  }
  modInt &operator*=(const modInt &n) {
    v = ll(v) * n.v % mod;
    return *this;
  }
  modInt &operator/=(const modInt &n) {
    v = ll(v) * modpow(n.v, -1, mod) % mod;
    return *this;
  }
  modInt &operator+=(const ll &n) {
    v += n;
    if (v >= mod) v -= mod;
    return *this;
  }
  modInt &operator-=(const ll &n) {
    v -= n;
    if (v < 0) v += mod;
    return *this;
  }
  modInt &operator*=(const ll &n) {
    v = ll(v) * n % mod;
    return *this;
  }
  modInt &operator/=(const ll &n) {
    v = ll(v) * modpow(n, -1, mod) % mod;
    return *this;
  }
};
template <int mod>
ostream &operator<<(ostream &os, const modInt<mod> &n) {
  return os << n.v;
};
template <int mod>
modInt<mod> operator+(const ll &n, const modInt<mod> &m) {
  return m.v + n < mod ? m.v + n : m.v + n - mod;
}
template <int mod>
modInt<mod> operator-(const ll &n, const modInt<mod> &m) {
  return n - m.v < 0 ? n - m.v + mod : n - m.v;
}
template <int mod>
modInt<mod> operator*(const ll &n, const modInt<mod> &m) {
  return ll(m.v) * (n % mod) % mod;
}
template <int mod>
modInt<mod> operator/(const ll &n, const modInt<mod> &m) {
  return modInt<mod>(n % mod) / m;
}
template <int mod>
modInt<mod> modpow(modInt<mod> r, ll n) {
  modInt<mod> re(1);
  if (n < 0) (n %= mod - 1) += mod - 1;
  for (; n; n /= 2) {
    if (n & 1) re *= r;
    r *= r;
  }
  return re;
}
vector<modInt<MOD>> fact, finv, inv;
modInt<MOD> comb(ll n, ll r) {
  if (n < r || r < 0) return 0;
  return fact[n] * finv[n - r] * finv[r];
}
class Doralion {
  void Modinvs(vector<modInt<MOD>> &re, int n) {
    re.resize(n + 1);
    re[1] = 1;
    for (int i = 2; i <= n; ++i) re[i] = re[MOD % i] * (MOD - MOD / i);
  }
  void Facts(vector<modInt<MOD>> &re, int n) {
    re.resize(n + 1);
    re[0] = 1;
    for (int(i) = 0; (i) < (n); ++(i)) re[i + 1] = re[i] * (i + 1);
  }
  void Factinvs(vector<modInt<MOD>> &re, const vector<modInt<MOD>> &inv,
                int n) {
    re.resize(n + 1);
    re[0] = 1;
    for (int(i) = 0; (i) < (n); ++(i)) re[i + 1] = re[i] * inv[i + 1];
  }

 public:
  Doralion(int n) {
    Modinvs(inv, n);
    Facts(fact, n);
    Factinvs(finv, inv, n);
  }
} doralion(1123456);
pll modFibPair(ll i, ll q) {
  if (!i) return pll(0, 1);
  if (i % 2) {
    pll f = modFibPair(i / 2, q);
    ll a = f.first, b = f.second, c = (a + b) % q;
    return pll((a * a % q + b * b % q) % q, (a * b % q + b * c % q) % q);
  } else {
    pll f = modFibPair(i - 1, q);
    return pll(f.second, (f.first + f.second) % q);
  }
}
ll modFib(ll i, ll q) { return modFibPair(i, q).first; }
modInt<MOD> solve(int n, int m) { return modFib(m + 1, MOD); }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(0);
  int n, m;
  cin >> n >> m;
  if (n == 1 && m == 1) {
  } else if (n == 1 && m == 2) {
  } else if (n == 2 && m == 1) {
  } else if (n == 2 && m == 2) {
  }
  modInt<MOD> re = 1;
  re += solve(n, m) - 1;
  re += solve(m, n) - 1;
  re *= 2;
  cout << re << endl;
  return 0;
}
