#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<stack>

using namespace std;

#define int long long
#define rep(i,n) for(int i = 0; i < (n); i++)
#define INF (long long)(1e18)
#define MOD (int)(1e9+7)

#define yn(f) ((f)?"Yes":"No")
#define YN(f) ((f)?"YES":"NO")



void hoge(int n, int B){
	int re = 0, tn = n;
	stack<int> ans;
	B *= -1;
	
	for(int b = B; ; b*=B){//cout<<tn<<" "<<b<<" "<<tn%b<<endl;
		ans.push((tn%b)/(b/B)); 
		tn -= tn%b;
		b *= B;
		if(tn == 0) break;
		ans.push(((b-tn%b)%b)/(b/B));//cout<<tn<<" "<<b<<" "<<tn%b<<" "<<((b+b-tn%b)%b)/(b/B)<<endl;
		tn += (b-tn%b)%b;
		if(tn == 0) break;
	}
	if(ans.top() == 0&& n != 0) ans.pop();
	
	while(!ans.empty()){
		cout<<ans.top();
		ans.pop();
	}cout<<endl;
}

signed main(){
	cout<<fixed<<setprecision(7);
	
	int N, T, B;
	
	cin>>T>>B;
	
	for(int i = 0; i < T; i++){
		cin>>N;
		// cout<<hoge(N)<<endl;
		hoge(N,B);
	}
	
	return 0;
}