#include <bits/stdc++.h>
using namespace std;
int main()
{
	int t,a,b,c,d;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d%d%d",&a,&b,&c,&d);
		if(b>=a) 
		{
			printf("%d\n",b);
			continue;
		}
		else
		{
			int res=a-b;
			if(d>=c)
			{
				printf("-1\n");
				continue;
			}
			else
			{
				int t=ceil((double)res/(c-d));
				printf("%lld\n",1ll*t*c+1ll*b);
			}
		}
	}
 } 

#include <bits/stdc++.h>
using namespace std;
const int maxn=2e5+13;
char s[maxn];
int flag[4];
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		for(int i=1;i<=3;i++) flag[i]=0;
		int ans=0x7fffffff;
		int yes=1;
		scanf("%s",s+1);
		int len=strlen(s+1);
		for(int i=1;s[i];i++)
		{
			flag[s[i]-'0']=1;
		}
		for(int i=1;i<=3;i++)
		{
			if(!flag[i]) yes=0;
		}
		if(!yes) {
		printf("0\n");continue;}
		int k=1,st;
	    while(s[k]==s[1]) k++;
	    st=k-1;
		for(int i=k;i<=len;i++)
		{
			int j=i;
			while(s[j]==s[i]) j++;
			if(j>len) {
			break;}
			if(s[j]!=s[st]) ans=min(ans,j-i+2);
			st=j-1;
			i=st;
		}
		printf("%d\n",ans);
	 } 
 }