#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<long long>;
using vvll = vector<vector<long long>>;
using vvvll = vector<vector<vector<long long>>>;
using vvvvll = vector<vector<vector<vector<long long>>>>;
using vpll = vector<pair<ll, ll>>;
using vs = vector<string>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using pll = pair<ll, ll>;
#define REP(i, n) for (long long i = 0; i < n; i++)
#define REP2(i, n, m) for (long long i = n; i < m; i++)
#define REPv(v) for (auto itr = v.begin(); itr != v.end(); itr++)
#define REPIN(v) \
  for (long long i = 0; i < (long long)v.size(); i++) cin >> v[i];
#define been(vec) vec.begin(), vec.end()
#define LIN      \
  = []() {       \
    long long x; \
    cin >> x;    \
    return x;    \
  }()
#define SIN   \
  = []() {    \
    string x; \
    cin >> x; \
    return x; \
  }()
#define SPNL(i, SIZE) (i + 1 == SIZE ? '\n' : ' ')
ll gcd(ll x, ll y) { return (x % y) ? gcd(y, x % y) : y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
bool chmin(ll &a, const ll &b) { return (a > b && ((a = b) | 1)); }
bool chmax(ll &a, const ll &b) { return (a < b && ((a = b) | 1)); }

using namespace std;
int main() {
  ll t LIN;
  const string of = "Overflow", zr = "Zero", sf = "Safe";
  REP(_, t) {
    ll v, x, fo, fi, q, r;
    cin >> v >> x >> fo >> fi >> q >> r;
    ll c1, c2;
    c1 = (fi - fo) * r;
    c2 = fo * (q - r);
    // cout << c1 << " " << c2 << endl;
    if (c1 <= 0)
      cout << zr << endl;
    else if (c1 == c2) {
      if (v < c1 + x)
        cout << of << endl;
      else
        cout << sf << endl;
    } else if (c1 > c2) {
      cout << of << endl;
    } else {
      cout << zr << endl;
    }
  }
}