#include //#include using namespace std; //using namespace atcoder; //using mint = modint998244353; //const int mod = 998244353; //using mint = modint1000000007; //const int mod = 1000000007; //const int INF = 1e9; //const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n-1); i >= 0; --i) #define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define P pair template inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t; cin >> t; while (t--) { long long v, x, out, in, q, r; cin >> v >> x >> out >> in >> q >> r; long long cycle = -q * out + r * in; long long mid = r * (in - out); if (cycle > 0) { cout << "Overflow" << endl; } else if (cycle < 0) { if (mid >= 0) { if (mid + x > v)cout << "Overflow" << endl; else cout << "Zero" << endl; } else { cout << "Zero" << endl; } } else { if (mid + x > v)cout << "Overflow" << endl; else cout << "Safe" << endl; } } return 0; }