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

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;

#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcount

#define INF 1e16
#define mod 1000000007

ll n,m;

vector<vector<ll> > operator*(const vector<vector<ll> >& a,const vector<vector<ll> >& b){
  vector<vector<ll> > res(m+1,vector<ll>(2,0));

  rep(i,m+1)rep(j,2){
    res[i][j]=(a[i][0]*b[0][j]%mod+a[i][1]*b[1][j]%mod)%mod;
  }
  (res[m][0]+=b[m][0])%=mod;
  (res[m][1]+=b[m][1])%=mod;

  return res;
}

int main(){
  cin>>n>>m;
  vector<vector<ll> > a(m+1,vector<ll>(2,0));
  ll f0=0,f1=1;
  rep(i,m+1){
    a[m-i][0]=f1; a[m-i][1]=f0;
    ll f2=(f1+f0)%mod;
    f0=f1; f1=f2;
  }
  f0=0,f1=1;
  rep(i,m-1){
    ll f2=(f1+f0)%mod;
    f0=f1; f1=f2;
  }

  vector<vector<ll> > res=a;
  n--;
  while(n>0){
    if(n&1)res=res*a;
    a=a*a;
    n>>=1;
  }

  cout<<(res[m][0]*f1%mod+res[m][1]*f0%mod)%mod<<endl;

  return 0;
}