#include<map>
#include<set>
#include<queue>
#include<deque>
#include<cmath>
#include<ctime>
#include<bitset>
#include<vector>
#include<cstdio>
#include<string>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
#define mkp make_pair
#define lb lower_bound
#define ub upper_bound
#define eb emplace_back
#define fs fflush(stdout)
#define ump unordered_map
#define pq priority_queue
#define clz __builtin_clz
#define ctz __builtin_ctz
#define space putchar(' ')
#define enter putchar('\n')
#define sz(x) (int)x.size()
#define np next_permutation
#define clzl __builtin_clzll
#define par __builtin_parity
#define ctzl __builtin_ctzll
#define ppc __builtin_popcount
#define parl __builtin_parityll
#define all(x) x.begin(),x.end()
#define ppcl __builtin_popcountll
#define ms(x,y) memset(x,y,sizeof(x))
#define debug(x) cerr<<#x<<"= "<<(x)<<'\n'
template<class T> inline T &read(T &x){
	x=0;int f=1;char ch=getchar();
	while(ch<48||ch>57){if(ch=='-') f=-f;ch=getchar();}
	while(ch>=48&&ch<=57) x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
	return x*=f;
}
template<class T> inline void print(T x){
	static char buf[40];static int cnt=0;
	if(x<0) putchar(45),x=-x;
	do buf[++cnt]=x%10^48;while(x/=10);
	do putchar(buf[cnt--]);while(cnt);
}
#define mod 998244353
#define inf 0x3f3f3f3f
#define fpi freopen("","r",stdin)
#define fpo freopen("","w",stdout)
ll n;
void exgcd(__int128 a,__int128 b,__int128 &x,__int128 &y){
	if(!b){x=1,y=0;return ;}
	exgcd(b,a%b,x,y);
	__int128 z=x;x=y,y=z-a/b*y;
}
inline ll lmod(ll x){return x+(x>>63&n);}
inline __int128 ksm(__int128 cur,__int128 indx){
	__int128 res=1;
	while(indx){
		if(indx&1) (res*=cur)%=n;
		(cur*=cur)%=n,indx>>=1;
	}return res;
}
void solve(){
	__int128 c1=read(c1),c2=read(c2),e1=read(e1),e2=read(e2),x,y,xx,xxx,yy,ans=1;read(n);
	exgcd(e1,e2,x,y),exgcd(c1,n,xx,yy),xx=lmod(xx%n),exgcd(c2,n,xxx,yy),xxx=lmod(xxx%n);
	if(x<0) (ans*=ksm(xx,-x))%=n;else (ans*=ksm(c1,x))%=n;
	if(y<0) (ans*=ksm(xxx,-y))%=n;else (ans*=ksm(c2,y))%=n;
	print(ans),enter;
	return ;
}
int main(){
	int t=read(t);while(t--) solve();
}