// Problem: No.2622 Dam
// Contest: yukicoder
// URL: https://yukicoder.me/problems/no/2622
// Memory Limit: 512 MB
// Time Limit: 2000 ms

#include<bits/stdc++.h>
#define debug(x) cerr<<(#x)<<" "<<(x)<<endl
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define pii pair<ll,ll>
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define per(i,a,b) for(ll i=(a);i>=(b);--i)
using namespace std;
bool Mbe; 
ll read(){
	ll x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
void write(ll x){
	if(x<0)putchar('-'),x=-x;
	if(x>9)write(x/10);
	putchar(x%10+'0');
}
ll T,X,V,Fo,Fi,R,Q;
void solve(){
		ll d1=R*(Fi-Fo);
		ll d2=-(Q-R)*Fo;
		if(X+d1<=0){
			puts("Zero");
			return ;
		}
		if(X+d1>V){
			puts("Overflow");
			return ;
		}
		if(d1+d2<0){
			puts("Zero");
			return ;
		}
		if(d1+d2==0){
			puts("Safe");
			return ;
		}
		puts("Overflow");
}
bool Med;
int main(){
	cerr<<fabs(&Med-&Mbe)/1048576.0<<"MB\n";
	T=read();
	while(T--){
		V=read(),X=read(),Fo=read(),Fi=read(),Q=read(),R=read();
		solve();
	}
	return 0;
}