#include using namespace std; //#include //using namespace atcoder; //using mint = modint998244353; //using mint = modint1000000007; typedef long long ll; typedef unsigned long long ull; #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() const int MAX = 1e9; const int MIN = -1*1e9; const ll MAXLL = 1e18; const ll MINLL = -1*1e18; //const ll MOD = 998244353; //const ll MOD = 1000000007; int main() { int T; cin >> T; for(int t = 0; t < T; t++) { ll V,X,F_O,F_I,Q,R; cin >> V >> X >> F_O >> F_I >> Q >> R; X -= F_O*R; X += F_I*R; if(V < X) { cout << "Overflow" << endl; continue; } if(F_O*Q == F_I*R) cout << "Safe" << endl; else cout << (F_O*Q < F_I*R ? "Overflow" : "Zero") << endl; } return 0; }