#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 1'000'000'007;
using Mint = ModInt<MO>;

constexpr int LIM_INV = 110;
Mint inv[LIM_INV], fac[LIM_INV], invFac[LIM_INV];

void prepare() {
  inv[1] = 1;
  for (int i = 2; i < LIM_INV; ++i) {
    inv[i] = -((Mint::M / i) * inv[Mint::M % i]);
  }
  fac[0] = invFac[0] = 1;
  for (int i = 1; i < LIM_INV; ++i) {
    fac[i] = fac[i - 1] * i;
    invFac[i] = invFac[i - 1] * inv[i];
  }
}
Mint binom(Int n, Int k) {
  if (n < 0) {
    if (k >= 0) {
      return ((k & 1) ? -1 : +1) * binom(-n + k - 1, k);
    } else if (n - k >= 0) {
      return (((n - k) & 1) ? -1 : +1) * binom(-k - 1, n - k);
    } else {
      return 0;
    }
  } else {
    if (0 <= k && k <= n) {
      assert(n < LIM_INV);
      return fac[n] * invFac[k] * invFac[n - k];
    } else {
      return 0;
    }
  }
}


Mint interpolateIota(const vector<Mint> &fs, Mint x) {
  const int fsLen = fs.size();
  vector<Mint> prodR(fsLen + 1);
  prodR[fsLen] = 1;
  for (int i = fsLen; --i >= 0; ) prodR[i] = (x - i) * prodR[i + 1];
  Mint ans = 0;
  Mint prodL = 1;
  for (int i = 0; i < fsLen; ++i) {
    // (i - 0) ... (i - (i - 1)) (i - (i + 1)) ... (i - (fsLen - 1))
    ans += invFac[i] * (((fsLen - 1 - i) & 1) ? -1 : +1) *
           invFac[fsLen - 1 - i] * fs[i] * prodL * prodR[i + 1];
    prodL *= (x - i);
  }
  return ans;
}


/*
  A B = lcm(1, ..., K)
  lcm(x, x+1, ..., x+K) = F(x) G(x) H(x)
  F(x): determined by (x mod A)
  G(x): determined by (x mod B)
  
  x = A B h + A i - B j  (0 <= i < B, 0 <= j < A)
  fix j
  \sum[h,i] G(A i) (A B h + A i - B j)^(rise K+1)
  
  precalc partial sums:
  \sum[i] G(A i) (Z + A i)^(rise K+1)
  = \sum[i] G(A i) \sum[0<=k<=K+1] binom(K+1, k) (A i)^(rise K+1-k) Z^(rise k)
  
  0 < x <= N
  B j < A (B h + i) <= N + B j
  \sum[0<=h<H] (eval at Z = A B h - B j)
    poly of H of degree K+2
*/

constexpr int PLen = 10;
constexpr int P[PLen] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29};
int E[PLen];
int Q[PLen];

Mint g[4'000'010][32];

int main() {
  prepare();
  
  Int N;
  int K;
  for (; ~scanf("%lld%d", &N, &K); ) {
    for (int i = 0; i < PLen; ++i) {
      E[i] = 0;
      Q[i] = 1;
      for (; Q[i] * P[i] <= K; Q[i] *= P[i]) ++E[i];
    }
// cerr<<"E = ";pv(E,E+PLen);
// cerr<<"Q = ";pv(Q,Q+PLen);
    int H = -1;
    Int A = 0, B = 0;
    for (int h = 0; h < 1 << PLen; ++h) {
      Int a = 1, b = 1;
      for (int i = 0; i < PLen; ++i) {
        ((h >> i & 1) ? b : a) *= Q[i];
      }
      if (a == 1 || 6 * a <= b) {
        if (chmax(A, a)) {
          H = h;
          B = b;
        }
      }
    }
cerr<<"A = "<<A<<", B = "<<B<<endl;
    
    vector<vector<Mint>> fss(PLen);
    for (int i = 0; i < PLen; ++i) {
      vector<int> es(Q[i], 0);
      for (int x = 0; x < Q[i]; ++x) {
        for (int xx = x ? x : Q[i]; xx % P[i] == 0; xx /= P[i]) ++es[x];
      }
      fss[i].resize(Q[i]);
      for (int x = 0; x < Q[i]; ++x) {
        int sum = 0, mx = 0;
        for (int k = 0; k <= K; ++k) {
          const int xx = (x + k) % Q[i];
          sum += es[xx];
          chmax(mx, es[xx]);
        }
// cerr<<P[i]<<" "<<x<<": "<<mx-sum<<endl;
        fss[i][x] = Mint(P[i]).pow(mx - sum);
      }
    }
    vector<Mint> F(A, 1), G(B, 1);
    for (int i = 0; i < PLen; ++i) {
      if (H >> i & 1) {
        int xx = 0;
        for (int x = 0; x < B; ++x) {
          G[x] *= fss[i][xx];
          if (++xx == Q[i]) xx = 0;
        }
      } else {
        int xx = 0;
        for (int x = 0; x < A; ++x) {
          F[x] *= fss[i][xx];
          if (++xx == Q[i]) xx = 0;
        }
      }
    }
    
    for (int i = 0; i < B; ++i) {
      const Mint gai = G[(A * i) % B];
      const Mint ai = Mint(A) * i;
      Mint prod = 1;
      for (int k = K+1; k >= 0; --k) {
        g[i + 1][k] = g[i][k] + gai * binom(K+1, k) * prod;
        prod *= (ai + (K+1 - k));
      }
    }
    
    Mint ans = 0;
    
    const Int q0 = (N / A + 1) / B;
    vector<Mint> sums[2];
    for (int h = 0; h < 2; ++h) {
      sums[h].assign(K + 3, 0);
    }
    
    for (int j = 0; j < A; ++j) {
      vector<Mint> ss(K + 3, 0);
      for (int h = 0; h < K + 2; ++h) {
        const Mint z = A * B * h - B * j;
        Mint w = g[B][K+1];
        for (int k = K; k >= 0; --k) {
          w *= (z + k);
          w += g[B][k];
        }
        ss[h + 1] = ss[h] + w;
      }
      
      /*
      // 0 <= B h + i < m
      auto solve = [&](Int m) -> Mint {
        const Int q = m / B, r = m % B;
        Mint ret = 0;
        ret += (q < K + 3) ? ss[q] : interpolateIota(ss, q);
        {
          const Mint z = A * B * q - B * j;
          Mint w = g[r][K+1];
          for (int k = K; k >= 0; --k) {
            w *= (z + k);
            w += g[r][k];
          }
          ret += w;
        }
        return ret;
      };
      const Mint fbj = F[(B * (A - j)) % A];
      ans += fbj * (solve((N + B * j) / A + 1) - solve((B * j) / A + 1));
      */
      
      const Mint fbj = F[(B * (A - j)) % A];
      const int r0 = (B * j) / A + 1;
      const Int m = (N + B * j) / A + 1;
      const Int q = m / B;
      const int r1 = m % B;
      for (int k = 0; k < K + 3; ++k) {
        sums[q - q0][k] += fbj * ss[k];
      }
      {
        const Mint z = 0 - B * j;
        Mint w = g[r0][K+1];
        for (int k = K; k >= 0; --k) {
          w *= (z + k);
          w += g[r0][k];
        }
        ans -= fbj * w;
      }
      {
        const Mint z = A * B * q - B * j;
        Mint w = g[r1][K+1];
        for (int k = K; k >= 0; --k) {
          w *= (z + k);
          w += g[r1][k];
        }
        ans += fbj * w;
      }
    }
    
    for (Int q = q0; q <= q0 + 1; ++q) {
      ans += interpolateIota(sums[q - q0], q);
    }
    
    printf("%u\n", ans.x);
    
#ifdef LOCAL
if(N<=10000){
 Mint brt=0;
 for(int x=1;x<=N;++x){
  Mint prod=F[x%A]*G[x%B];
  for(int k=0;k<=K;++k)prod*=(x+k);
  brt+=prod;
 }
 cerr<<"brt = "<<brt<<endl;
}
#endif
  }
  return 0;
}
/*
1000000000000000000 30

524223287
*/