#include <iostream>
#include <algorithm>
#include <vector>
#include <array>

using namespace std;

const int mod = 1e9 + 7;

struct Modint {
  int n;
  Modint(int n = 0) : n(n) {}
};

Modint operator+(Modint a, Modint b) { return (a.n += b.n) >= mod ? a.n - mod : a.n; }
Modint operator-(Modint a, Modint b) { return (a.n -= b.n) < 0 ? a.n + mod : a.n; }
Modint operator*(Modint a, Modint b) { return 1LL * a.n * b.n % mod; }
Modint &operator+=(Modint &a, Modint b) { return a = a + b; }
Modint &operator-=(Modint &a, Modint b) { return a = a - b; }
Modint &operator*=(Modint &a, Modint b) { return a = a * b; }

// ax + b
using P = pair<Modint, Modint>;

P mul(P p, P q) {
  // p * q = ax^2 + bx + c = a(x + 1) + bx + c
  Modint a = p.first * q.first;
  Modint b = p.first * q.second + p.second * q.first;
  Modint c = p.second * q.second;
  return {a + b, a + c};
}

P fib(long long x) {
  P res(0, 1);
  P a(1, 0);
  while (x > 0) {
    if (x & 1) {
      res = mul(res, a);
    }
    a = mul(a, a);
    x >>= 1;
  }
  return res;
}

// Find x^0 + x^m + ... + x^(m(n-1))
// if n is even then 
//   x^0 + x^m + ... + x^{mn-m}
//  +x^{nm} + ... + x^{2mn-m}
// = f(n/2)(1 + x^{nm})
// otherwise
//   1 + x^m + ... + x^{mn-m}
// = 1 + x^m f(n-1)
P f(long long n, long long m) {
  if (n == 0) return {0, 0};
  if (n % 2 == 0) {
    P res = f(n / 2, m);
    P p = fib(n * m / 2);
    p.second += 1;
    return mul(res, p);
  } else {
    P res = f(n - 1, m);
    res = mul(res, fib(m));
    res.second += 1;
    return res;
  }
}

int main() {
  long long n, m;
  cin >> n >> m;
  cout << f(n + 1, m).first.n << endl;
}