#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007

int main(){
  long long n, m; cin >> n >> m;
  long long a[2][2] = {{1, 1}, {1, 0}};
  long long ans[2] = {1, 0};
  long long ma[2][2] = {{1, 1}, {1, 0}}; m--;
  while (m != 0) {
    if (m % 2) {
      long long tmp[2][2] = {0};
      for (int i = 0; i < 2; i++) {
        for (int j = 0; j < 2; j++) {
          tmp[i][j] = 0;
          for (int k = 0; k < 2; k++) {
            tmp[i][j] += ma[i][k] * a[k][j];
            tmp[i][j] %= mod;
          }
        }
      }
      swap(ma, tmp);
    }
    long long b[2][2] = {0};
    for (int i = 0; i < 2; i++) {
      for (int j = 0; j < 2; j++) {
        b[i][j] = 0;
        for (int k = 0; k < 2; k++) {
          b[i][j] += a[i][k] * a[k][j];
          b[i][j] %= mod;
        }
      }
    }
    swap(a, b);
    m /= 2;
  }
  long long s[4][4] = {{1, 0, 1, 0}, {0, 1, 0, 1}, {1, 0, 0, 0}, {0, 1, 0, 1}};
  long long u[4][4] = {{1, 0, ma[0][0], ma[0][1]}, {0, 1, ma[1][0], ma[1][1]},
                       {0, 0, ma[0][0], ma[0][1]}, {0, 0, ma[1][0], ma[1][1]}};
  while (n != 0) {
    if (n % 2) {
      long long tmp[4][4] = {0};
      for (int i = 0; i < 4; i++) {
        for (int j = 0; j < 4; j++) {
          tmp[i][j] = 0;
          for (int k = 0; k < 4; k++) {
            tmp[i][j] += u[i][k] * s[k][j];
            tmp[i][j] %= mod;
          }
        }
      }
      swap(s, tmp);
    }
    long long b[4][4] = {0};
    for (int i = 0; i < 4; i++) {
      for (int j = 0; j < 4; j++) {
        b[i][j] = 0;
        for (int k = 0; k < 4; k++) {
          b[i][j] += u[i][k] * u[k][j];
          b[i][j] %= mod;
        }
      }
    }
    swap(u, b);
    n /= 2;
  }
  cout << s[1][0] << endl;
  return 0;
}