#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

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

int main() {
  int t; cin >> t;
  while (t--) solve();
  return 0;
}