#include <bits/stdc++.h>
using namespace std;
bool debug = 1;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
long long ln, lk, lm;
struct Matrix {
  int n = 32, m = 32;
  long long a[40][40];
  Matrix() {}
  Matrix(int n, int m) : n(n), m(m) {}
  void init(long long num) {
    for (int i = 0; i < n; i++)
      for (int j = 0; j < m; j++) a[i][j] = num;
  }
  Matrix operator*(Matrix b) {
    Matrix o = Matrix(n, b.m);
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < b.m; j++) {
        o.a[i][j] = 0;
        for (int k = 0; k < m; k++) {
          o.a[i][j] =
              (o.a[i][j] + (a[i][k] * b.a[k][j]) % 1000000007) % 1000000007;
        }
      }
    }
    return o;
  }
};
int len, num[100];
Matrix f[70][35], pre[35], suf[35], ans;
int main() {
  scanf("%lld%d", &ln, &k);
  for (; ln; ln /= k) num[len++] = ln % k;
  ans.a[0][k] = 1;
  for (int(i) = 0; (i) < (int)(k); (i)++)
    for (int j = 0; j <= k; j++) {
      f[0][i].a[j][i] = 1;
      f[0][i].a[j][j] = 1;
    }
  for (int i = 1; i < len; i++) {
    pre[0] = f[i - 1][0];
    for (int(j) = 1; (j) <= (int)(k - 1); (j)++)
      pre[j] = pre[j - 1] * f[i - 1][j];
    suf[k - 1] = f[i - 1][k - 1];
    for (int j = k - 2; j >= 0; j--) {
      suf[j] = f[i - 1][j] * suf[j + 1];
    }
    f[i][0] = suf[0];
    for (int j = 1; j < k; j++) {
      f[i][j] = suf[j] * pre[j - 1];
    }
  }
  for (int i = len, s = 0; i >= 0; s += num[i], i--) {
    for (int j = 0; j < num[i]; j++) {
      ans = ans * f[i][(j + s) % k];
    }
  }
  int rs = 0;
  for (int i = 0; i <= k; i++) {
    (rs += ans.a[0][i]) %= 1000000007;
  }
  printf("%d\n", rs);
  return 0;
}
