/** author: shobonvip created: 2025.02.14 20:18:54 **/ #include using namespace std; //* ATCODER #include using namespace atcoder; typedef modint998244353 mint; //*/ /* BOOST MULTIPRECISION #include using namespace boost::multiprecision; //*/ typedef long long ll; #define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++) #define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--) #define all(v) v.begin(), v.end() template bool chmin(T &a, const T &b) { if (a <= b) return false; a = b; return true; } template bool chmax(T &a, const T &b) { if (a >= b) return false; a = b; return true; } template T max(vector &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]); return ret; } template T min(vector &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]); return ret; } template T sum(vector &a){ T ret = 0; for (int i=0; i<(int)a.size(); i++) ret += a[i]; return ret; } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); string s1, s2, t1, t2; string x1, x2; cin >> s1 >> x1 >> t1; cin >> s2 >> x2 >> t2; if (x1.size() > x2.size()) { cout << s1 << '\n'; }else if(x1.size() < x2.size()){ cout << s2 << '\n'; }else{ if (x1 > x2) { cout << s1 << '\n'; }else if(x1 < x2) { cout << s2 << '\n'; }else{ cout << -1 << '\n'; } } }