import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;

enum mod = 10L ^^ 9 + 7;

void main() {
    int t, b;
    scan(t, b);

    while (t--) {
        int n;
        scan(n);
        auto ans = solve(n, b);
        writeln(ans);
    }
}

string solve(int n, int b) {
    if (n == 0) {
        return "0";
    }

    string ans;

    while (n > 0) {
        int r = n % abs(b);
        int m = (n - r) / b;
        int s = (m % abs(b) + abs(b)) % abs(b);
        debug {
            writeln(r, " ", s);
        }
        ans = s.to!string ~ r.to!string ~ ans;
        n = (m - s) / b;
    }

    while (!ans.empty && ans.front == '0') {
        ans.popFront();
    }

    return ans;
}




void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}


void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}