#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define endl '\n'
const int inf = 1e9 + 11;
int MOD = 1e9 + 7;
const ll INF = 1LL << 60;
bool is_prime(long long n) {  // is n prime or not
	for (long long i = 2; i * i <= n; i++) {
		if (n % i == 0) return false;
	}
	return true;
}
vector<bool> make_is_prime(int N) {
	vector<bool> prime(N + 1, true);
	if (N >= 0) prime[0] = false;
	if (N >= 1) prime[1] = false;
	for (int i = 2; i * i <= N; i++) {
		if (!prime[i]) continue;
		for (int j = i * i; j <= N; j += i) {
			prime[j] = false;
		}
	}
	return prime;
}
vector<bool>ab;
void solve() {
	ll a, p; cin >> a >> p;
	if (ab[p]) {
		if (a % p == 0) {
			cout << 0 << endl;
		}
		else {
			cout << 1 << endl;
		}
	}
	else cout << -1 << endl;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	ab.resize(5000010);
	ab = make_is_prime(5000010);
	int t; cin >> t;
	rep(_, t) {
		solve();
	}
	return 0;
}