/* Problem URL: https://codeforces.com/contest/2132/problem/C2 */

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template <class T, class comp = less<>>
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;

#define V vector

#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)

#define rep(i, lim) for (int i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)

#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;

using ll = long long;

using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;

template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
    os << vec[0];
    for (size_t i = 1; i < vec.size(); i++) {
        os << ' ' << vec[i];
    }
    os << '\n';
    return os;
}

template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
    for (auto &i : vec) {
        is >> i;
    }
    return is;
}

template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
    for (auto &i : vec) {
        os << i[0];
        for (size_t j = 1; j < i.size(); j++) {
            os << ' ' << i[j];
        }
        os << '\n';
    }
    return os;
}

template<class v>
auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
    for (auto &i : vec) {
        for (auto &j : i) {
            is >> j;
        }
    }
    return is;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    vl pows(21);
    pows[0] = 1;

    nrep(i, 1, 21) {
        pows[i] = pows[i - 1] * 3;
    }

    int t;
    cin >> t;
    while (t--) {
        ll n, k;
        cin >> n >> k;

        vi count(21);

        ll now = 20;
        ll total = 0; 

        while (now >= 0) {
            count[now] = n / pows[now];
            total += count[now];
            n %= pows[now];

            now--;
        }

        if (total > k) {
            cout << "-1\n";
            continue;
        }

        for (int j = 20; j > 0; j--) {
            for (int i = j - 1; i >= 0; i--) {
                int low = 0;
                int high = count[j];
                ll ans = 0;
                while (low <= high) {
                    int mid = (low + high) >> 1;

                    if (total - mid + (pows[j] / pows[i]) * mid <= k) {
                        ans = mid;
                        low = mid + 1;
                        continue;
                    }

                    high = mid - 1;
                }

                total -= ans;
                total += ans * (pows[j] / pows[i]);
                count[j] -= ans;
                count[i] += ans * (pows[j] / pows[i]);
            }
        }

        ll ans = 0;
        rep(i, 20) {
            ans += count[i] * (pows[i + 1] + pows[max(0LL, (ll)i - 1)] * i);
        }

        cout << ans << '\n';
    }
}