#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define llint long long
#define inf 1e18
#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)
#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))

using namespace std;
typedef pair<llint, llint> P;

llint T;
llint a, p;
bool prime[5000005];

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	prime[1] = true;
	for(int i = 2; i < 5000005; i++){
		if(prime[i]) continue;
		for(int j = 2*i; j < 5000005; j+=i) prime[j] = true;
	}
	
	cin >> T;
	for(int t = 0; t < T; t++){
		cin >> a >> p;
		if(prime[p]) cout << -1 << "\n";
		else{
			if(a % p == 0) cout << 0 << "\n";
			else cout << 1 << "\n";
		}
	}
	flush(cout);

	return 0;
}