#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using mint = atcoder::modint998244353;

void solve(){
	ll v,x,fa,fb,q,r;
	cin>>v>>x>>fa>>fb>>q>>r;
	if(x+(fb-fa)*r>v){
		cout<<"Overflow\n";
		return;
	}
	ll ad,gn;
	ad=r*fb;
	gn=q*fa;
	if(ad>gn) cout<<"Overflow\n";
	else if(ad<gn) cout<<"Zero\n";
	else cout<<"Safe\n";
}

int main(){
	int t;
	cin>>t;
	rep(i,t) solve();
}