#include <iostream>
#include <cmath>
using namespace std;

void solve() {
    int n, m;
    cin >> n >> m;
    while (m -- ) {
        if (n >= 10) {
            n = ceil(sqrt(n));
        } else if (n >= 0) {
            int m1 = ceil(sqrt(n));
            int m2 = n - 1;
            int m3 = (n + 1) / 2;
            n = min(min(m1, m2), m3);
        } else {
            n -= m + 1;
            break;
        }
    }
    cout << n << endl;
}

int main() {
    int T;
    cin >> T;
    while (T -- ) solve();
    return 0;
}