#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
	int t, b; cin>>t>>b;
	for(int i=0; i<t; i++){
		int n; cin>>n;
		if(n==0){
			cout<<0<<endl;
			continue;
		}
		vector<int> ans;
		int c=0;
		while(n!=0){
			int r;
			if(n<0) r=(-b-(-n)%(-b))%(-b);
			else r=n%(-b);
			ans.push_back(r);
			n-=r;
			n/=(-b);
			n=-n;
		}
		reverse(ans.begin(), ans.end());
		for(auto x:ans) cout<<x;
		cout<<endl;
	}
	return 0;
}