#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
using namespace std;


#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

typedef long long ll;
typedef unsigned long long ull;
typedef long double lb;
/* ここからが本編 */
#define NUM 1000000000
void dekakeisann(ull a[],char op,ull b,int num)
{
   long i,j;
   if(op == '*') {
      for(j = num-1; j > -1; j--) {
         a[j] *= b;
         if(a[j] >= NUM) {
            int tmp = a[j] / NUM;
            a[j+1] += tmp;
            a[j] -= tmp * NUM;
         }
      }
   }
   else {
      for(j = num-1; j > -1; j--) {
         a[j] /= b;
         if(a[j] % b) {
            a[j-1] += (a[j] % b) * NUM;
         }
      }
   }
}
void soroeru(ull a[],int num) 
{
   long i,j;
   for(j = 0; j < num; j++){
      if(a[j] >= NUM) {
         int tmp = a[j] / NUM;
         a[j+1] += tmp;
         a[j] -= tmp * NUM;
      }
   }
}

int main(void)
{
   long i,j;
   long r;
   ull n,m;
   static ull com[10001] = {1,0};
   cin >> n >> m;

   n /= 1000;
   r = n % m;
   n = m;
   for(i=0;i<r;i++) dekakeisann(com,'*',n-i,10000);

   for(i=0;i<r;i++) dekakeisann(com,'/',r-i,10000);
   soroeru(com,10000);
   printf("%llu\n",com[0]);

   return 0;
}