#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<algorithm>
#include<vector>
#include<queue>
#include<list>
#include<string>
#include<set>
#include<map>
#include<iomanip>
#include<sstream>
#include<functional>
#include<climits>
#include<unordered_set>
#include<unordered_map>
#include<bitset>

const long double eps = 1e-5;
const int MOD = 1000000007;
using namespace std;

int n, a, P;
bool find(long long num) {
  if(num < P) return false;
  if(num == P || num == P + 1) return true;
  if(num % P != 0 && (num - 1) % P != 0) return false;
  return num % P == 0 ? find(num / P) : find((num - 1) / P);
}
int solve(int num, int rem) {
  if(num < P) return 0;
  if(num == P && rem == 0) return 0;
  if(num == P && rem == 1) return 0;
  if(num == P + 1 && rem == 0) return 1;
  if(num == P + 1 && rem == 1) return 1;
  if(num == P + 2 && rem == 1) return 1;
  if(num == 2 * P + 1 && rem == 0) return 1;
  if(num == 2 * P + 1 && rem == 1) return 1;
  if(num == 2 * P && rem == 1) return 1;
  if(num == 2 * P + 2 && rem == 1) return 1;
  if(rem > 2) return 0;
  if((num - 1) % P == 0) {
    int pp = (num - 1) / P;
    int c = pp / 2;
    if(find(c) && ((c * P + c * P + 1 == num) || (((c + 1) * P + (c + 1) * P + 1) == num))) return 1;
  }
  if(num % P == 0) return find(num - 1) + solve(num / P, 0);
  if((num - 2) % P == 0) return find(num - 1) + solve((num - 2) / P, 0);
  if((num - 1) % P == 0) return find(num - 1) + 2 * solve((num - 1) / P, 1);
  return 0;
}

// Bruteforce ================
unordered_set<int> bfNums;
void bruteforce(int x) {
  if(x > 1000000) return;
  bfNums.insert(x);
  bruteforce(P * x);
  bruteforce(P * x  + 1);
}

int waysBf(int x) {
  int w = 0;
  for(unordered_set<int> ::iterator it = bfNums.begin(); it != bfNums.end(); ++it) {
    int p = *it;
    if(p != x - p) {
      w += bfNums.count(x - p);
      // if(x == 165 && bfNums.count(x - p) cout << p <<  " " << x - p << endl;
    }
  }
  return w / 2;
}
//================================

int main() {
  scanf("%d %d", &n, &P);
  bruteforce(1);
  for(int a = 1; a <= n; ++a) {
    int w = 0;
    if(a % 2 == 1 && find(a / 2) && find(a / 2 + 1)) w = 1;
    else w = solve(a, 0);
    int wBf = waysBf(a);
    if(w != wBf) {
      printf("Mismatch for number %d - ways %d, waysBf %d.\n", a, w, wBf);
    }
  }
  return 0;
}