#include using namespace std; #define DEBUG(x) cerr<<#x<<": "< #define vl vector #define vii vector< vector > #define vll vector< vector > #define vs vector #define pii pair #define pis pair #define psi pair #define pll pair template pair operator+(const pair &s, const pair &t) { return pair(s.first + t.first, s.second + t.second); } template pair operator-(const pair &s, const pair &t) { return pair(s.first - t.first, s.second - t.second); } template ostream& operator<<(ostream& os, pair p) { os << "(" << p.first << ", " << p.second << ")"; return os; } #define X first #define Y second #define rep(i,n) for(int i=0;i<(n);i++) #define rep1(i,n) for(int i=1;i<=(n);i++) #define rrep(i,n) for(int i=(n)-1;i>=0;i--) #define rrep1(i,n) for(int i=(n);i>0;i--) #define REP(i,a,b) for(int i=a;i bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; } #define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end()); const ll inf = 1000000001; const ll INF = 1e18; const ll MOD = 1000000007; //const ll MOD = 998244353; const double pi = 3.14159265358979323846; #define Sp(p) cout<> t >> b; while (t--) { ll n; cin >> n; string ans; ll mul = 1; while (n > 0) { if (mul > 0) { ll diff = n % abs(mul*b); ans.push_back('0' + diff / mul); n -= diff; } else { ll diff = (abs(mul*b) - n % abs(mul*b)) % abs(mul*b); ans.push_back('0' + diff / -mul); n += diff; } mul *= b; } while (ans.back() == '0') ans.pop_back(); reverse(all(ans)); if (ans.size() == 0) { ans += '0'; } cout << ans << endl; } }