//
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P>IP;
typedef vector<ll> V;
typedef vector<V> V2;
typedef vector<vector<P> > G;
void g_dir(G &graph, ll a, ll b, ll w = 1){graph[a].push_back(P(b, w));}
void g_undir(G &graph, ll a, ll b, ll w = 1){g_dir(graph, a, b, w);g_dir(graph, b, a, w);}
#define rep(i, n) for(ll (i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for(ll (i) = 1; (i) <= (n); (i)++)
#define rrep(i, n) for(ll (i) = (n) - 1; (i) >= 0; (i)--)
#define rrep1(i, n) for(ll (i) = (n); (i) >= 1; (i)--)
template<class T> void chmax(T &a, const T &b){if(a < b){a = b;}}
template<class T> void chmin(T &a, const T &b){if(a > b){a = b;}}
const ll INF = 1145141919;
const ll MOD = 1000000007;
const ll NUM = 101010;

const ll X = 70;

int main(){

    ll N, B;
    cin >> N >> B;
    B = -B;

    ll hoge[X][10];
    for(ll i = 0, p = 1; i < X; i++, p *= (-B)){
        rep(j, B){
            hoge[i][j] = j * p;
        }
    }
    ll mn[X], mx[X];
    mn[0] = 0;
    mx[0] = B - 1;
    for(ll i = 1; i < X; i++){
        mn[i] = mn[i - 1];
        mx[i] = mx[i - 1];
        if(hoge[i][B - 1] > 0)mx[i] += hoge[i][B - 1];
        else mn[i] += hoge[i][B - 1];
    }
    rep(n, N){
        ll t;
        cin >> t;
        ll idx = 0;
        rep(i, X)if(mn[i] <= t && t <= mx[i]){
            idx = i;
            break;
        }         
        for(;idx > 0;idx--){
            rrep(j, B){
                ll tmp = t - hoge[idx][j];
                if(mn[idx - 1] <= tmp && tmp <= mx[idx - 1]){
                    cout << j;
                    t = tmp;
                    break;
                }
            }
        }
        rep(j, B)if(hoge[idx][j] == t)cout << j;
        cout << endl;
    }
    

    return 0;
}