#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;

string solve(ll N, ll B){
  if(N == 0) return "0";
  
  vector<int> v(60, 0);

  while(N != 0){
    ll p, q, r = 1, sum = 0;
    if(N > 0){
      p = 1;
      q = 0;
    }else{
      p = B;
      q = 1;
    }
    while(abs(sum + p*r) < abs(N)){
      r++;
      if(r == abs(B)){
        sum += p * (abs(B)-1);
        p *= B * B;
        q += 2;
        r = 1;
      }
    }
    v[q] = r;
    N -= p*r;
  }

  stringstream ss;
  bool flg = false;
  for(int i=v.size()-1; i>=0; i--){
    if(v[i] != 0) flg = true;
    if(flg) ss << v[i];
  }
  
  return ss.str();
}

int main(){
  int T, B;
  cin >> T >> B;
  rep(i,T){
    int n;
    cin >> n;
    cout << solve(n, B) << endl;
  }
  
  return 0;
}