放心抄

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll f(ll a,ll b,ll y){
	ll ans=1;
	for(int i=1;i<=b;i++){
		ans*=a;
		if(ans>=y){
			return ans;
		}
	}
	return ans;
}
void solve(){
	ll n,y;
	cin>>n>>y;
	ll l=1,r=y;
	while(l<=r){
		ll mid=(l+r)/2;
        ll y1=f(mid,n,y);
		if(y1>=y){
			r=mid-1;
		}
		else{
			l=mid+1;
		}
	}
	if(pow(l,n)==y){
		cout<<l<<endl;
	}
	else{
		cout<<-1<<endl;
	}
}
int main()
{
	int t;
	cin>>t;
	while(t--){
		solve();
	}
    return 0;
}