#include <bits/stdc++.h>
#define int long long
#define re register
#define inf 0x3f3f3f3f
#define N 10202000
using namespace std;
const int mo=998244353;
inline int read(){
    int x=0,w=0;char ch=getchar();
    while (!isdigit(ch))w|=ch=='-',ch=getchar();
    while (isdigit(ch))x=(x<<1)+(x<<3)+ch-'0',ch=getchar();
    return w?-x:x;
}
int n,m,l,r,x,f[32][200][200];
int dfs(int k,int lim1,int lim2){
	if (k==-1)return 0;
	if (~f[k][lim1][lim2])return f[k][lim1][lim2];
	int dn=lim1?((l>>k)&1):0,up=lim2?((r>>k)&1):1,ans=-1;
	if (((x>>k)&1)){
		for (int i=1;i<=m;i+=2){
			if (i<lim1&&dn)continue;
			if (i>m-lim2&&!up)continue;
			int t=dfs(k-1,dn?lim1:max(lim1-i,0ll),up?max(lim2-(m-i),0ll):lim2);
			if (t==-1)continue;
			ans=max(ans,i*(1ll<<k)+t);
		}
	}else{
		for (int i=0;i<=m;i+=2){
			if (i<lim1&&dn)continue;
			if (i>m-lim2&&!up)continue;
			int t=dfs(k-1,dn?lim1:max(lim1-i,0ll),up?max(lim2-(m-i),0ll):lim2);
			if (t==-1)continue;
			ans=max(ans,i*(1ll<<k)+t);
		}
	}
	return f[k][lim1][lim2]=ans;
}
signed main(){
	int T=read();
	while (T--){
		n=read(),l=read(),r=read(),x=read();
		if (n==1){
			if (l<=x&&x<=r)
				printf("%lld\n",x);
			else puts("-1");
			continue;
		}
		memset(f,-1,sizeof(f));
		m=min(n,30ll);
		if ((m^n)&1)++m;
		int ans=dfs(30,m,m);
		if (ans==-1)puts("-1");
		else printf("%lld\n",ans+(n-m)*r);
	}
    return 0;
}