#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <cmath>   
#include<cctype>
#include<string>
#include<set>
#include<iomanip>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
using Data = pair<ll, vector<int>>;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 50;
struct edge { ll from; ll to; ll cost; };

string conv(int n,int d) {
	string ret = "";
	if (n == 0)return "0";
	while (n != 0) {
		if (n > 0) {
			int temp = n % d;
			ret += to_string(temp);
			n -= temp;
			n /= d;
			n *= -1;
		}
		else {
			int temp = (d - (abs(n) % d)) % d;
			ret += to_string(temp);
			n -= temp;
			n /= d;
			n *= -1;
		}
	}
	reverse(all(ret));
	return ret;
}

int main() {
	int t, b;
	cin >> t >> b;
	
	rep(i, 0, t) {
		int n;
		cin >> n;
		cout << conv(n,-b) << endl;
	}

	return 0;
}