#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const ll MOD = 1000000007;

typedef vector<ll> vec;
typedef vector<vec> mat;

mat mul(mat& A, mat& B) {
    mat C(A.size(), vec(B[0].size(), 0));
    for (int i = 0; i < A.size(); i++) {
        for (int k = 0; k < B.size(); k++) {
            for (int j = 0; j < B[0].size(); j++) {
                (C[i][j] += A[i][k] * B[k][j] % MOD) %= MOD;
            }
        }
    }
    return C;
}

mat pow(mat A, ll n) {
    mat B(A.size(), vec(A.size(), 0));
    for (int i = 0; i < A.size(); i++) {
        B[i][i] = 1;
    }
    while (n > 0) {
        if (n & 1) B = mul(B, A);
        A = mul(A, A);
        n >>= 1;
    }
    return B;
}

ll modpow(ll x, ll n, ll mod = MOD) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return res;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    mat A = {{0, 1}, {1, 1}};
    ll n;
    int m;
    cin >> n >> m;
    mat C = pow(A, m - 1);
    mat B = {{0}, {1}};
    ll f1 = mul(C, B)[0][0];
    C = mul(C, A);
    ll f2 = mul(C, B)[0][0];
    C = mul(C, A);
    ll f3 = mul(C, B)[0][0];

    mat D = {{f1, f2}, {f2, f3}};
    mat E = pow(D, n + 1);
    mat F = D;
    for (int i = 0; i < 2; i++) {
        for (int j = 0; j < 2; j++) {
            E[i][j] = (MOD + (i == j) - E[i][j]) % MOD;
            F[i][j] = (MOD + (i == j) - F[i][j]) % MOD;
        }
    } 

    assert(F[0][0] * F[1][1] != F[0][1] * F[1][0]);
    ll dv = (F[0][0] * F[1][1] - F[0][1] * F[1][0] + MOD * MOD) % MOD;
    //cout << dv << endl;
    swap(F[0][0], F[1][1]);
    swap(F[0][1], F[1][0]);
    F[0][1] = (MOD-F[0][1]) % MOD;
    F[1][0] = (MOD-F[1][0]) % MOD;
    mat G = mul(E, F);
    ll ans = (mul(G, B)[0][0] + MOD) % MOD * modpow(dv, MOD - 2) % MOD;
    cout << ans << endl;
    return 0;
}