#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }


int main() {
  ll T, B; cin >> T >> B; B*=-1;
  ll N[T]; rep(i,T) cin >> N[i];
  rep(i,T) {
    ll d1 = N[i] % B; N[i] = (N[i]-d1) / B;
    vector<ll> dd; while (N[i]) { 
      if (N[i]%(B*B)>=B*(B-1)+1) { dd.push_back(N[i]%(B*B)-B*B); N[i]/=B*B; N[i]++; }
      else { dd.push_back(N[i]%(B*B)); N[i]/=B*B; }
    }
    // debug(all(dd));
    vector<ll> result; result.push_back(d1);
    for (auto x: dd) { 
      result.push_back((B-x%B)%B);
      result.push_back((x+(B-1))/B);
    }
    reverse(all(result));
    for (auto x: result) cout << x; cout << endl;
  }
  return 0;
}