Problem: Assume that sk(n) equals the sum of digits of number n in the k-based notation. For example, s2(5) = s2(1012) = 1 + 0 + 1 = 2, s3(14) = s3(1123) = 1 + 1 + 2 = 4.

The sequence of integers a0, ..., an - 1 is defined as <image>. Your task is to calculate the number of distinct subsequences of sequence a0, ..., an - 1. Calculate the answer modulo 109 + 7.

Sequence a1, ..., ak is called to be a subsequence of sequence b1, ..., bl, if there is a sequence of indices 1 ≤ i1 < ... < ik ≤ l, such that a1 = bi1, ..., ak = bik. In particular, an empty sequence (i.e. the sequence consisting of zero elements) is a subsequence of any sequence.

Input

The first line contains two space-separated numbers n and k (1 ≤ n ≤ 1018, 2 ≤ k ≤ 30).

Output

In a single line print the answer to the problem modulo 109 + 7.

Examples

Input

4 2


Output

11


Input

7 7


Output

128

Note

In the first sample the sequence ai looks as follows: (0, 1, 1, 0). All the possible subsequences are: 

(), (0), (0, 0), (0, 1), (0, 1, 0), (0, 1, 1), (0, 1, 1, 0), (1), (1, 0), (1, 1), (1, 1, 0).

In the second sample the sequence ai looks as follows: (0, 1, 2, 3, 4, 5, 6). The subsequences of this sequence are exactly all increasing sequences formed from numbers from 0 to 6. It is easy to see that there are 27 = 128 such sequences.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int dp[70][50][50][50];
int tmp[50][50];
int base[50];
int get_dig(int pos, int k) {
  return (pos < k) ? pos : (get_dig(pos / k, k) + pos % k) % k;
}
inline int get_val(int depth, int i, int j, int shift, int k) {
  if (i == k && j < k) {
    return dp[depth][0][k][(j + k - shift) % k];
  } else if (i < k && j < k) {
    return dp[depth][0][(i + k - shift) % k][(j + k - shift) % k];
  }
  return dp[depth][0][i][j];
}
int main() {
  long long n;
  int k;
  cin >> n >> k;
  int max_depth = 0;
  {
    long long tmp = n;
    while (tmp != 0) {
      ++max_depth;
      tmp /= k;
    }
  }
  {
    for (int df = 0; df < 1; ++df) {
      for (int i = 0; i <= k; ++i) {
        for (int j = 0; j <= k; ++j) {
          dp[0][df][i][j] = (i == j || j == df);
        }
      }
    }
    for (int depth = 1; depth < max_depth; ++depth) {
      for (int df = 0; df < 1; ++df) {
        for (int i = 0; i <= k; ++i) {
          for (int j = 0; j <= k; ++j) {
            dp[depth][df][i][j] = (i == j);
          }
        }
        for (int pos = 0; pos < k; ++pos) {
          for (int i = 0; i <= k; ++i) {
            for (int j = 0; j <= k; ++j) {
              tmp[i][j] = 0;
              for (int l = 0; l <= k; ++l) {
                tmp[i][j] = (tmp[i][j] +
                             1ll * dp[depth][df][i][l] *
                                 get_val(depth - 1, l, j, (pos + df) % k, k)) %
                            MOD;
              }
            }
          }
          for (int i = 0; i <= k; ++i) {
            for (int j = 0; j <= k; ++j) {
              dp[depth][df][i][j] = tmp[i][j];
            }
          }
        }
      }
    }
  }
  for (int i = 0; i <= k; ++i) {
    base[i] = (i == k);
  }
  int sl = 0;
  long long x = n;
  vector<int> vec;
  while (x != 0) {
    vec.push_back(x % k);
    x /= k;
  }
  int len = int(vec.size());
  for (int cur_depth = len - 1; cur_depth >= 0; --cur_depth) {
    int rest = vec[cur_depth];
    for (int it = 0; it < rest; ++it, sl = (sl + 1) % k) {
      for (int i = 0; i <= k; ++i) {
        tmp[0][i] = 0;
        for (int l = 0; l <= k; ++l) {
          tmp[0][i] =
              (tmp[0][i] + 1ll * base[l] * get_val(cur_depth, l, i, sl, k)) %
              MOD;
        }
      }
      for (int i = 0; i <= k; ++i) {
        base[i] = tmp[0][i];
      }
    }
  }
  {
    int res = 0;
    for (int i = 0; i <= k; ++i) {
      res = (res + base[i]) % MOD;
    }
    cout << res << '\n';
  }
  return 0;
}