#include<algorithm> #include<iostream> #include<cstring> #include<cstdio> #define inf 0x7fffffff #define MAXN 100001 using namespace std; inline int read() { int x = 0, f = 1; char ch = getchar(); while (ch < '0' || ch > '9') { if (ch == '-')f = -1; ch = getchar(); } while (ch >= '0' && ch <= '9') { x = x * 10 + ch - '0'; ch = getchar(); } return x*f; } int n, k; long long a[1100], b[1100], temp = 1; int main() { n = read(); k = read(); a[0] = 1; for (int i = 1; i <= 18; i++) temp *= 10; for (int i = 1; i <= k; i++) for (int j = i; j <= n; j++) { b[j] = b[j] + b[j - i]+(a[j] + a[j - i]) / temp; a[j] = (a[j] + a[j - i]) % temp; } if (b[n])printf("%lld", b[n]); printf("%lld", a[n]); return 0; }