#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int t, b; cin >> t >> b;
  while (t--) {
    ll n; cin >> n;
    if (n == 0) {
      cout << 0 << '\n';
      continue;
    }
    vector<int> ans;
    while (n > 0) {
      ans.emplace_back(n % -b);
      n /= -b;
    }
    REP(i, ans.size()) {
      if (ans[i] >= -b) {
        if (i + 1 == ans.size()) ans.emplace_back(0);
        ans[i + 1] += ans[i] / -b;
        ans[i] %= -b;
      }
      if ((i & 1) && ans[i] > 0) {
        if (i + 1 == ans.size()) ans.emplace_back(0);
        ++ans[i + 1];
        ans[i] = -b - ans[i];
      }
    }
    for (int i = ans.size() - 1; i >= 0; --i) cout << ans[i];
    cout << '\n';
  }
  return 0;
}