#include <iostream>
#include <vector>

using namespace std;

int main() {
    ios::sync_with_stdio(0);
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];

    }
    vector<int> pos;
    pos.push_back(0);
    int val = a[0];
    int up = -1;
    for (int i = 1; i < n; i++) {
        if (up == -1) {
            if (a[i] > val) {
                up = 1;
                val = a[i];
                pos.push_back(i);
            } else if (a[i] < val) {
                up = 0;
                val = a[i];
                pos.push_back(i);
            }
        } else if (up == 1) {
            if (a[i] < val) {
                pos.push_back(i);
                break;
            }
            val = a[i];
            pos[pos.size() - 1] = i;
        } else if (up == 0) {
            if (a[i] > val) {
                pos.push_back(i);
                break;
            }
            val = a[i];
            pos[pos.size() - 1] = i;

        }
    }
    if (pos.size() < 3) {
        cout << 0;
    } else {
        cout << 3 << endl;
        for (int x : pos) {
            cout << ++x << " ";
        }
    }
}


#include <bits/stdc++.h>

using namespace std;

#define all(B) (B).begin(), (B).end()
#define sz(B) (B).size()
#define pb push_back
#define mp make_pair
#define sc second
#define fr first

typedef long long ll;
typedef pair<ll , ll> pll;
typedef pair<int , int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
typedef vector<pll> vll;

const int MAX = 1e5 + 10;
const int inf = 2e9 + 10;
const int mod = 1e9 + 7;
const double eps = 1e-15;

int n, a[MAX];
bool ok1, ok2;

int main(){
      cin >> n;

      for(int i = 1;i <= n;++i){
            cin >> a[i];
      }

      for(int i = 2;i <= n;++i){
            if(a[i] > a[i - 1]){
                  ok1 = 1;
            }
            if(a[i] < a[i - 1]){
                  ok2 = 1;
            }

            if(ok1 && ok2){
                  cout << "3\n";
                  cout << 1 << " " << i - 1 << " " << i;
                  return 0;
            }
      }

      cout << 0;
}


#include <bits/stdc++.h>

using namespace std;

#define all(B) (B).begin(), (B).end()
#define sz(B) (B).size()
#define pb push_back
#define mp make_pair
#define sc second
#define fr first

typedef long long ll;
typedef pair<ll , ll> pll;
typedef pair<int , int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
typedef vector<pll> vll;

const int MAX = 1e5 + 10;
const int inf = 2e9 + 10;
const int mod = 1e9 + 7;
const double eps = 1e-15;

int n, a[MAX], i1, i2;
bool ok1, ok2;

int main(){
      cin >> n;

      for(int i = 1;i <= n;++i){
            cin >> a[i];
      }

      for(int i = 1;i < n;++i){
            if(a[i] > a[i + 1]){
                  ok1 = 1;
                  i1 = i;
            }
            if(a[i] < a[i + 1]){
                  ok2 = 1;
                  i2 = i;
            }
      }

      if(ok1 && ok2){
            cout << 3 << "\n";
            if(i1 > i2)swap(i1, i2);

            for(int i = i1 - (i1 != 1);i <= i2 + 1;++i){
                  if((a[i1] > a[i] && a[i] < a[i2]) ||
                     (a[i1] < a[i] && a[i] > a[i2])){
                        cout << i1 << " " << i << " " << i2;
                        return 0;
                  }
            }
      }
      else cout << 0;
}


#include <bits/stdc++.h>

using namespace std;

#define all(B) (B).begin(), (B).end()
#define sz(B) (B).size()
#define pb push_back
#define mp make_pair
#define sc second
#define fr first

typedef long long ll;
typedef pair<ll , ll> pll;
typedef pair<int , int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
typedef vector<pll> vll;

const int MAX = 1e5 + 10;
const int inf = 2e9 + 10;
const int mod = 1e9 + 7;
const double eps = 1e-15;

int n, a[MAX], i1, i2;
bool ok1, ok2;

int main(){
      cin >> n;

      for(int i = 1;i <= n;++i){
            cin >> a[i];
      }

      for(int i = 1;i < n;++i){
            if(a[i] > a[i + 1]){
                  ok1 = 1;
                  i1 = i;
            }
            if(a[i] < a[i + 1]){
                  ok2 = 1;
                  i2 = i;
            }
      }

      if(ok1 && ok2){
            cout << 3 << "\n";
            if(i1 < i2){
                  for(int i = i1 + 1;i < i2 + 1;++i){
                        if(a[i1] > a[i] && a[i] < a[i2 + 1]){
                              cout << i1 << " " << i << " " << i2 << "\n";
                        }
                  }
            }
            else {
                  for(int i = i2 + 1;i < i1 + 1;++i){
                        if(a[i2] < a[i] && a[i] > a[i1 + 1]){
                              cout << i1 << " " << i << " " << i2 << "\n";
                        }
                  }
            }
      }
}


#include <bits/stdc++.h>
#include <ext/numeric>
using namespace std;
using namespace __gnu_cxx;

#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define REV(i,b,a) for(ll i=(a);i>=(b);i--)
#define mp make_pair
#define pb push_back
#define oo (1<<30)
#define INF 1000000000000
#define sz(v) (int)v.size()
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define mem(s,v) memset(s,v,sizeof(s))
#define ppc(x) __builtin_popcount((x))
#define sc(x)   scanf("%d",&x);
#define iter(it,s) for(__typeof(s.begin())it = s.begin();it!=s.end();it++)

typedef long long ll;
typedef vector<int> vi;

ll dx[] = { 0, 0, 1, -1 };
ll dy[] = { 1, -1, 0, 0 };

const int N = 1e5 + 10;
int arr[N];
int n;
int main() {
#ifndef ONLINE_JUDGE
    //freopen("in.txt", "rt", stdin);
    //    freopen("o.txt", "wt", stdout);
#endif
    int n;
    scanf("%d", &n);
    for (int i = 0; i < n; i++)
        scanf("%d", &arr[i]);
    vi ans;
    ans.push_back(1);
    for (int i = 1; i < n && ans.size() != 3; i++) {
        if (arr[i] > arr[0]) {
            ans.push_back(i + 1);
            int last = i;
            for (int j = last + 1; j < n; j++) {
                if (arr[j] < arr[last]) {
                    ans.push_back(j + 1);
                    break;
                }
            }
            if(ans.size()!=3){
                ans.pop_back();
            }
        }
    }
    if (ans.size() == 3) {
        cout << 3 << endl << ans[0] << " " << ans[1] << " " << ans[2];
        return 0;
    }
    ans.resize(1);
    ans[0] = 1;
    for (int i = 1; i < n && ans.size() != 3; i++) {
        if (arr[i] < arr[0]) {
            ans.push_back(i + 1);
            int last = i;
            for (int j = last + 1; j < n; j++) {
                if (arr[j] > arr[last]) {
                    ans.push_back(j + 1);
                    break;
                }
            }
            if(ans.size()!=3){
                        ans.pop_back();
                       }
        }
    }
    if (ans.size() == 3) {
        cout << 3 << endl << ans[0] << " " << ans[1] << " " << ans[2];
        return 0;
    }
    cout << 0;
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,p;
cin>>n>>p;
int a[n]={};
vector<int> v;
p=2*p;
while(p--)
{ int x;
cin>>x;
v.push_back(x);
}
sort(v.begin(),v.end());
for(int i=0;i<v.size();i++)
a[v[i]-1]++;
int flag=0;
for(int i=0;i<n;i++)
{

if(a[i]==0)
{
	flag=1;
	break;
}}
if(flag==1)
cout<<"Oh, my keyboard!";
else
cout<<"I become the guy.";

}


#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,p;
cin>>n>>p;
int a[n]={0};
vector<int> v;
p=2*p;
while(p--)
{ int x;
cin>>x;
v.push_back(x);
}
int flag=0;
sort(v.begin(),v.end());
for(int i=0;i<v.size();i++)
a[v[i]-1]++;
for(int i=0;i<n;i++)
if(a[i]==0)
flag++;
if(flag!=0)
cout<<"Oh, my keyboard!";
else
cout<<"I become the guy.";
}}


#include<iostream>
#include<stdio.h>
using namespace std;

int main()
{
    int p,q,m,i,count=0,n,merge[101];
    cin>>n;

    cin>>p;
    int a[p];
    for(i=0;i<p;i++)
    {
        cin>>a[i];
        m=a[i];
        merge[m]=1;
    }

    cin>>q;
    int b[q];
    for(i=0;i<q;i++)
    {
        cin>>b[i];
        m=b[i];
        merge[m]=1;
    }
    for(i=0;i<=n;i++)
    {
       if(merge[i]==1)
       {
           count++;
       }
    }
    if(count==n)
    {
        cout<<"I  become a guy.";
    }
    else
    {
        cout<<"Oh,my keyboard!";
    }

}


#include<iostream>
#include<stdio.h>
using namespace std;

int main()
{
    int p,q,m,i,count=0,n,merge[101];
    cin>>n;

    cin>>p;
    int a[p];
    for(i=0;i<p;i++)
    {
        cin>>a[i];
        m=a[i];
        merge[m]=1;
    }

    cin>>q;
    int b[q];
    for(i=0;i<q;i++)
    {
        cin>>b[i];
        m=b[i];
        merge[m]=1;
    }
    for(i=0;i<=n;i++)
    {
       if(merge[i]==1)
       {
           count++;
       }
    }
    if(count==n)
    {
        cout<<"I  become the guy.";
    }
    else
    {
        cout<<"Oh,my keyboard!";
    }

}


#include<iostream>
#include<stdio.h>
using namespace std;

int main()
{
    int p,q,m,i,count=0,n,merge[101];
    cin>>n;
    cout<<"enter p"<<endl;
    cin>>p;
    int a[p];
    for(i=0;i<p;i++)
    {
        cin>>a[i];
        m=a[i];
        merge[m]=1;
    }
     cout<<"enter q"<<endl;
    cin>>q;
    int b[q];
    for(i=0;i<q;i++)
    {
        cin>>b[i];
        m=b[i];
        merge[m]=1;
    }
    for(i=0;i<=n;i++)
    {
       if(merge[i]==1)
       {
           count++;
       }
    }
    if(count==n)
    {
        cout<<"I  become a guy.";
    }
    else
    {
        cout<<"Oh,my keyboard!";
    }

}


#include<iostream>
#include<stdio.h>
#include<cstring>
#include<cmath>
#include<math.h>
#include<algorithm>
using namespace std;
int main()
{

   int s[105],t[105];

   int i,n,p,q,flag=0;
   cin>>n;
   cin>>p;
   for(i=0;i<p;i++)
   {
       cin>>s[i];
   }
   cin>>q;
   for(i=0;i<q;i++)
   {
       cin>>t[i];
   }
   for(i=0;i<p;i++)
   {
       if(s[i]==n)
          flag=1;
       else
          flag=0;
   }
   for(i=0;i<q;i++)
   {
       if(t[i]==n)
          flag=1;
       else
          flag=0;
   }
   if(flag==1)
   {
       cout<<"I become the guy";
   }
   else
   {
       cout<<"Oh, my keyboard!";
   }

}


#include<iostream>
#include<stdio.h>
#include<cstring>
#include<cmath>
#include<math.h>
#include<algorithm>
using namespace std;
int main()
{

   int s[105],t[105];

   int i,n,p,q,flag=0;
   cin>>n;
   cin>>p;
   for(i=0;i<p;i++)
   {
       cin>>s[i];
   }
   cin>>q;
   for(i=0;i<q;i++)
   {
       cin>>t[i];
   }
   for(i=0;i<p;i++)
   {
       if(s[i]==n)
          flag=1;
       else
          flag=0;
   }
   for(i=0;i<q;i++)
   {
       if(t[i]==n)
          flag=1;
       else
          flag=0;
   }
   if(flag==1)
   {
       cout<<"I become the guy.";
   }
   else
   {
       cout<<"Oh, my keyboard!";
   }

}


#include<iostream>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
int main()
{
    int n,p,q,maxi,flag,i;
    cin>>n;
    cin>>p;

    int a[p];

    for(i=0;i<p;i++)
    {
        cin>>a[i];
    }
     cin>>q;
     int b[q];
    for(i=0;i<q;i++)
    {
        cin>>b[i];
    }
    a[maxi]=a[0];
    for(i=0;i<p;i++)
    {
        if(a[i]>=a[maxi])
        {
            a[maxi]=a[i];
        }
    }

    b[maxi]=b[0];
    for(i=0;i<q;i++)
    {
        if(b[i]>=b[maxi])
        {
            b[maxi]=b[i];
        }
    }
    if(a[maxi]== n || b[maxi]==n ||(a[maxi]==n && b[maxi]==n))
    {
        cout<<"I become the guy";
    }
    else

    {
         cout<<"oh,my keyboard";
    }

}


#include<iostream>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
int main()
{
    int n,p,q,maxi,flag,i;
    cin>>n;
    cin>>p;

    int a[p];

    for(i=0;i<p;i++)
    {
        cin>>a[i];
    }
     cin>>q;
     int b[q];
    for(i=0;i<q;i++)
    {
        cin>>b[i];
    }
    a[maxi]=a[0];
    for(i=0;i<p;i++)
    {
        if(a[i]>=a[maxi])
        {
            a[maxi]=a[i];
        }
    }

    b[maxi]=b[0];
    for(i=0;i<q;i++)
    {
        if(b[i]>=b[maxi])
        {
            b[maxi]=b[i];
        }
    }
    if(a[maxi]== n || b[maxi]==n ||(a[maxi]==n && b[maxi]==n))
    {
        cout<<"I become the guy.";
    }
    else

    {
         cout<<"Oh,my keyboard!";
    }

}


#include<iostream>
#include<stdio.h>
using namespace std;

int main()
{
    int p,q,m,i,count=0,n,merge[101];
    cin>>n;

    cin>>p;
    int a[p];
    for(i=0;i<p;i++)
    {
        cin>>a[i];
        m=a[i];
        merge[m]=1;
    }

    cin>>q;
    int b[q];
    for(i=0;i<q;i++)
    {
        cin>>b[i];
        m=b[i];
        merge[m]=1;
    }
    for(i=0;i<=n;i++)
    {
       if(merge[i]==1)
       {
           count++;
       }
    }
    if(count==n)
    {
        cout<<"I  become the guy.";
    }
    else
    {
        cout<<"Oh, my keyboard!";
    }

}


#include<iostream>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
int main()
{
    int n,p,q,maxi,flag,i;
    cin>>n;
    cin>>p;

    int a[p];

    for(i=0;i<p;i++)
    {
        cin>>a[i];
    }
     cin>>q;
     int b[q];
    for(i=0;i<q;i++)
    {
        cin>>b[i];
    }
    a[maxi]=a[0];
    for(i=0;i<p;i++)
    {
        if(a[i]>=a[maxi])
        {
            a[maxi]=a[i];
        }
    }

    b[maxi]=b[0];
    for(i=0;i<q;i++)
    {
        if(b[i]>=b[maxi])
        {
            b[maxi]=b[i];
        }
    }
    if(a[maxi]== n || b[maxi]==n ||(a[maxi]==n && b[maxi]==n))
    {
        cout<<"I become the guy.";
    }
    else

    {
         cout<<"oh,my keyboard!";
    }

}


#include<iostream>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
int main()
{
    int n,p,q,maxi,flag,i;
    cin>>n;
    cin>>p;

    int a[p];

    for(i=0;i<p;i++)
    {
        cin>>a[i];
    }
     cin>>q;
     int b[q];
    for(i=0;i<q;i++)
    {
        cin>>b[i];
    }
    a[maxi]=a[0];
    for(i=0;i<p;i++)
    {
        if(a[i]>=a[maxi])
        {
            a[maxi]=a[i];
        }
    }

    b[maxi]=b[0];
    for(i=0;i<q;i++)
    {
        if(b[i]>=b[maxi])
        {
            b[maxi]=b[i];
        }
    }
    if(a[maxi]== n || b[maxi]==n ||(a[maxi]==n && b[maxi]==n))
    {
        cout<<"I become the guy.";
    }
    else

    {
         cout<<"Oh, my keyboard!";
    }

}


#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{int n,p,q,a[200],i,c=0;
cin>>n>>p;
for(i=0;i<p;i=i+1)
{cin>>a[i];}
cin>>q;
for(i=p;i<p+q;i=i+1)
{cin>>a[i];}
sort(a,a+(p+q));
for(int i=0;i<(p+q)-1;i=i+1)
{if(a[i]!=a[i+1])
c=c+1;}
if(c==n)
cout<<"I become the guy."<<endl;
else
cout<<"Oh,my keyboard!"<<endl;
return 0;
}


#include<iostream>
#include<bits\stdc++.h>
using namespace std;
int main()
{int n,p,q,a[200],i,c=0;
cin>>n>>p;
for(i=0;i<p;i=i+1)
{cin>>a[i];}
cin>>q;
for(i=p;i<p+q;i=i+1)
{cin>>a[i];}
sort(a,a+(p+q));
for(int i=0;i<p+q-1;i=i+1)
{if(a[i]!=a[i+1])
c=c+1;}
if(c==n)
cout<<"I become the guy."<<endl;
else
cout<<"Oh,my keyboard!"<<endl;
return 0;
}


#include<iostream>
#include<bits\stdc++.h>
using namespace std;
int main()
{int n,p,q,a[200],i,c=0;
cin>>n>>p;
for(i=0;i<p;i=i+1)
{cin>>a[i];}
cin>>q;
for(i=p;i<p+q;i=i+1)
{cin>>a[i];}
sort(a,a+(p+q));
for(int i=0;i<p+q;i=i+1)
{if(a[i]!=a[i+1])
c=c+1;}
if(c==n)
cout<<"I become the guy."<<endl;
else
cout<<"Oh,my keyboard!"<<endl;
return 0;
}


#include<iostream>
#include<bits\stdc++.h>
using namespace std;
int main()
{int n,p,q,a[200],i,c=0;
cin>>n>>p;
for(i=0;i<p;i=i+1)
{cin>>a[i];}
for(i=p;i<p+q;i=i+1)
{cin>>a[i];}
sort(a,a+(p+q));
for(i=0;i<p+q;i=i+1)
{if(a[i]!=a[i+1])
c=c+1;}
if(c==n)
cout<<"I become the guy."<<endl;
else
cout<<"Oh,my keyboard!"<<endl;
return 0;
}


#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{int n,p,q,a[200],i,c=0;
cin>>n>>p;
for(i=0;i<p;i=i+1)
{cin>>a[i];}
cin>>q;
for(i=p;i<p+q;i=i+1)
{cin>>a[i];}
sort(a,a+(p+q));
for(int i=0;i<=p+q;i=i+1)
{if(a[i]!=a[i+1])
c=c+1;}
if(c==n)
cout<<"I become the guy."<<endl;
else
cout<<"Oh,my keyboard!"<<endl;
return 0;
}


#include<iostream>
#include<bits\stdc++.h>
using namespace std;
int main()
{int n,p,q,a[200],i,c=0;
cin>>n>>p;
for(i=0;i<p;i=i+1)
{cin>>a[i];}
cin>>q;
for(i=p;i<p+q;i=i+1)
{cin>>a[i];}
sort(a,a+(p+q));
for(i=0;i<p+q;i=i+1)
{if(a[i]!=a[i+1])
c=c+1;}
if(c==n)
cout<<"I become the guy."<<endl;
else
cout<<"Oh,my keyboard!"<<endl;
return 0;
}


#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{int n,p,q,a[200],i,c=0;
cin>>n>>p;
for(i=0;i<p;i=i+1)
{cin>>a[i];}
cin>>q;
for(i=p;i<p+q;i=i+1)
{cin>>a[i];}
sort(a,a+(p+q));
for(int i=0;i<p+q;i=i+1)
{if(a[i]!=a[i+1])
c=c+1;}
if(c==n)
cout<<"I become the guy."<<endl;
else
cout<<"Oh,my keyboard!"<<endl;
return 0;
}


#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{int n,p,q,a[200],i,c=0;
cin>>n>>p;
for(i=0;i<p;i=i+1)
{cin>>a[i];}
cin>>q;
for(i=p;i<p+q;i=i+1)
{cin>>a[i];}
sort(a,a+(p+q));
for(int i=0;i<p+q;i=i+1)
{if(a[i]!=a[i+1])
c=c+1;}
if(c==n)
cout<<"I become the guy."<<endl;
else
cout<<"Oh, my keyboard!"<<endl;
return 0;
}


#include <iostream>
#include <cstring>
#include <algorithm>

int main() {
    int n, p, q, v, flag = 1;
    std::cin >> n;
    n++;
    int *lvl = new int[n];
    memset(lvl, sizeof(lvl), 0);
    std::cin >> p;
    while (p--) {
        std::cin >> v;
        lvl[v]++;
    }
    std::cin >> q;
    while (q--) {
        std::cin >> v;
        lvl[v]++;
    }
    std::cout << (std::all_of(lvl + 1, lvl + n, [](int i) { return i > 0; }) ? "I become the guy."
                                                                             : "Oh, my keyboard!");
    return 0;
}


#include <iostream>
#include <cstring>
#include <algorithm>

int main() {
    int n, p;
    std::cin >> n;
    n++;
    int *lvl = new int[n];
    memset(lvl, sizeof(lvl), 0);
    std::cin.ignore('\n');
    while (std::cin >> p) lvl[p]++;
    for (int j = 0; j < n; ++j) {
        std::cout << lvl[j];
    }
    std::cout << (std::all_of(lvl, lvl + n, [](int i) { return i > 0; }) ? "I become the guy."
                                                                         : "Oh, my keyboard!");
    return 0;
}


#include <iostream>
#include <cstring>
int main() {
    int n, p, q, v, flag = 1;
    std::cin >> n;
    n++;
    int *lvl = new int[n];
    memset(lvl, sizeof(lvl), 0);
    std::cin >> p;
    while (p--) {
        std::cin >> v;
        lvl[v]++;
    }
    std::cin >> q;
    while (q--) {
        std::cin >> v;
        lvl[v]++;
    }
    for (int j = 1; j < n; ++j) {
        lvl[j] <= 0 ? flag = 0 : true;
    }
    std::cout << (flag ? "I become the guy." : "Oh, my keyboard!");
    return 0;
}


#include <iostream>

int main() {
    int n = (std::cin >> n, n), p = (std::cin >> p, p), a_i;
    int *a = new int[n + 1]{0};
    for (int i = 0; i < p; ++i) {
        std::cin >> a_i;
        a[a_i]++;
    }
    int q = (std::cin >> q, q);
    for (int j = 0; j < q; ++j) {
        std::cin >> a_i;
        a[a_i]++;
    }
    for (int k = 1; k <= n; ++k) {
        if (a[k] <= 0) {
            std::cout << "Oh, my keyboard!";
            goto OUT;
        }
    }
    std::cout << "I become the guy.";
    OUT:
    delete[] a;
    return 0;
}


#include <iostream>
#include <cstring>
#include <algorithm>

int main() {
    int n, p, q, v;
    std::cin >> n;
    n++;
    int *lvl = new int[n];
    memset(lvl, sizeof(lvl), 0);
    std::cin >> p;
    while (p--){
        std::cin >> v; lvl[v]++;
    }
    std::cin >> q;
    while (q--) {
        std::cin >> v; lvl[v]++;
    }
    std::cout << (std::all_of(lvl + 1, lvl + n, [](int i) { return i > 0; }) ? "I become the guy."
                                                                             : "Oh, my keyboard!");
    return 0;
}


#include <iostream>
#include <cstring>
#include <algorithm>

int main() {
    int n, p;
    std::cin >> n;
    n++;
    int *lvl = new int[n];
    memset(lvl, sizeof(lvl), 0);
    while (std::cin >> p) lvl[p]++;
    std::cout << (std::all_of(lvl + 1, lvl + n, [](int i) { return i > 0; }) ? "I become the guy."
                                                                             : "Oh, my keyboard!");
    return 0;
}


#include <iostream>
#include <set>

int main() {
    int n = (std::cin >> n, n), p, t = 0, g = 0;
    std::set<int> ints;
    while (std::cin >> p && ints.insert(p).second);
    for (auto j = ints.begin(); j != ints.end(); ++j, g += *j);
    for (int i = 0; i < n; ++i, t += i);
    std::cout << (t == g ? "I become the guy." : "Oh, my keyboard!");
    return 0;
}


#include <iostream>
#include <cstring>
#include <algorithm>

int main() {
    int n, p, q, v;
    std::cin >> n;
    int *lvl = new int[n];
    memset(lvl, sizeof(lvl), 0);
    std::cin >> p;
    for (int i = 0; i < p; ++i) {
        std::cin >> v;
        lvl[--v]++;
    }
    std::cin >> q;
    for (int i = 0; i < q; ++i) {
        std::cin >> v;
        lvl[--v]++;
    }
    std::cout << (std::all_of(lvl, lvl + n, [](int i) { return i > 0; }) ? "I become the guy."
                                                                             : "Oh, my keyboard!");
    return 0;
}


#include <iostream>
#include <cstring>
#include <algorithm>

int main() {
    int n, p, q, v, flag = 1;
    std::cin >> n;
    int *lvl = new int[n];
    memset(lvl, sizeof(lvl), 0);
    std::cin >> p;
    for (int i = 0; i < p; ++i) {
        std::cin >> v;
        lvl[--v]++;
    }
    std::cin >> q;
    for (int i = 0; i < q; ++i) {
        std::cin >> v;
        lvl[--v]++;
    }
    for (int j = 1; j < n; ++j) {
        lvl[j] <= 0 ? flag = 0 : true;
    }
    std::cout << (flag ? "I become the guy." : "Oh, my keyboard!");
    return 0;
}


#include <iostream>

int main() {
    int n = (std::cin >> n, n), p = (std::cin >> p, p), a_i;
    int *a = new int[n + 1];
    for (int i = 0; i < p; ++i) {
        std::cin >> a_i;
        i == 0 && (a[a_i] = i);
        a[a_i]++;
    }
    int q = (std::cin >> q, q);
    for (int j = 0; j < q; ++j) {
        std::cin >> a_i;
        j == 0 && (a[a_i] = j);
        a[a_i]++;
    }
    for (int k = 1; k <= n; ++k) {
        if (a[k] <= 0) {
            std::cout << "Oh, my keyboard!";
            goto OUT;
        }
    }
    std::cout << "I become the guy.";
    OUT:
    return 0;
}


#include <iostream>
#include <cstring>
#include <algorithm>

int main() {
    int n, p;
    std::cin >> n;
    n++;
    int *lvl = new int[n];
    memset(lvl, sizeof(lvl), 0);
    std::cin.ignore('\n');
    while (std::cin >> p) lvl[p]++;
    std::cout << (std::all_of(lvl+1, lvl + n, [](int i) { return i > 0; }) ? "I become the guy."
                                                                         : "Oh, my keyboard!");
    return 0;
}


#include <iostream>

int main() {
    int n = (std::cin >> n, n), p = (std::cin >> p, p), a_i, flag = 0;
    int *a = new int[n + 1]{0};
    for (int i = 0; i < p; ++i, std::cin >> a_i, a[a_i]++);
    int q = (std::cin >> q, q);
    for (int j = 0; j < q; ++j, std::cin >> a_i, a[a_i]++);
    for (int k = 1; k <= n && (a[k] <= 0 ? flag = 0, k = n : flag = 1); ++k);
    std::cout << (flag ? "I become the guy." : "Oh, my keyboard!");
    delete[] a;
    return 0;
}


#include <iostream>
#include <cstring>
#include <algorithm>

int main() {
    int n, p;
    std::cin >> n;
    n++;
    int *lvl = new int[n];
    memset(lvl, sizeof(lvl), 0);
    while (std::cin >> p) lvl[p]++;
    std::cout << (std::all_of(lvl+1, lvl + n, [](int i) { return i > 0; }) ? "I become the guy."
                                                                         : "Oh, my keyboard!");
    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,p,a,b,i,x[200],y[100],count=1;
    cin>>n>>p;
    for(i=0;i<p;i++){
        cin>>x[i]>>y[i];
    }
    for(i=p;i<2*p;i++){
        x[i]=y[i-p];
    }
    sort(x,x+2*p);
    for(i=0;i<2*p-1;i++){
            if(x[i]!=x[i+1]){
                count++;
            }

    }
    if(count==n){
        cout<<"I become the guy."<<endl;
    }
    else {
         cout<<"Oh, my keyboard!"<<endl;
    }
    return 0;

}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,p,a,b,q,i,x[205],y[200],count=1;
    cin>>n>>p;
    for(i=0;i<p;i++){
        cin>>x[i];
    }
    cin>>q;
    for(i=0;i<q;i++){
        cin>>y[i];
    }
    for(i=p;i<p+q;i++){
        x[i]=y[i-p];
    }
    sort(x,x+(p+q));
    for(i=0;i<p+q-1;i++){
            if(x[i]!=x[i+1]){
                count++;
            }

    }
    if(count>=n){
        cout<<"I become the guy."<<endl;
    }
    else {
         cout<<"Oh, my keyboard!"<<endl;
    }
    return 0;

}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,p,a,b,q,i,x[205],y[200],count=1;
    cin>>n>>p;
    for(i=0;i<p;i++){
        cin>>x[i];
    }
    cin>>q;
    for(i=0;i<q;i++){
        cin>>y[i];
    }
    for(i=p;i<p+q;i++){
        x[i]=y[i-p];
    }
    sort(x,x+(p+q));
    for(i=0;i<p+q-1;i++){
            if(x[i]!=x[i+1]){
                count++;
            }

    }
    if(p==0 && q==0){
        cout<<"Oh, my keyboard!"<<endl;
    }
    if(count>=n){
        cout<<"I become the guy."<<endl;
    }
    else {
         cout<<"Oh, my keyboard!"<<endl;
    }
    return 0;

}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,p,a,b,q,i,x[205],y[200],count=1;
    cin>>n>>p;
    for(i=0;i<p;i++){
        cin>>x[i];
    }
    cin>>q;
    for(i=0;i<q;i++){
        cin>>y[i];
    }
    for(i=p;i<p+q;i++){
        x[i]=y[i-p];
    }
    sort(x,x+p+q);
    for(i=0;i<p+q;i++){
            if(x[i]!=x[i+1]){
                count++;
            }

    }
    if(count>=n){
        cout<<"I become the guy."<<endl;
    }
    else {
         cout<<"Oh, my keyboard!"<<endl;
    }
    return 0;

}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,p,a,b,i,x[200],y[100],count=1;
    cin>>n>>p;
    for(i=0;i<p;i++){
        cin>>x[i]>>y[i];
    }
    for(i=p;i<2*p;i++){
        x[i]=y[i-p];
    }
    sort(x,x+2*p);
    for(i=0;i<2*p-1;i++){
            if(x[i]!=x[i+1]){
                count++;
            }

    }
    if(count>=n){
        cout<<"I become the guy."<<endl;
    }
    else {
         cout<<"Oh, my keyboard!"<<endl;
    }
    return 0;

}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,p,a,b,i,x[200],y[100],count=1;
    cin>>n>>p;
    for(i=0;i<p;i++){
        cin>>x[i]>>y[i];
    }
    for(i=p;i<2*p-1;i++){
        x[i]=y[i-p];
    }
    sort(x,x+2*p-1);
    for(i=0;i<2*p-1;i++){
            if(x[i]!=x[i+1]){
                count++;
            }

    }
    if(count>=n){
        cout<<"I become the guy."<<endl;
    }
    else {
         cout<<"Oh, my keyboard!"<<endl;
    }
    return 0;

}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,p,a,b,q,i,x[205],y[200],count=1;
    cin>>n>>p;
    for(i=0;i<p;i++){
        cin>>x[i];
    }
    cin>>q;
    for(i=0;i<q;i++){
        cin>>y[i];
    }
    for(i=p;i<p+q;i++){
        x[i]=y[i-p];
    }
    sort(x,x+(p+q));
    for(i=0;i<p+q-1;i++){
            if(x[i]!=x[i+1]){
                count++;
            }

    }
    if(p==0 && q==0){
        cout<<"Oh, my keyboard!"<<endl;
    }
    else if(count>=n){
        cout<<"I become the guy."<<endl;
    }
    else {
         cout<<"Oh, my keyboard!"<<endl;
    }
    return 0;

}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,p,a,b,i,x[205],y[200],count=1;
    cin>>n>>p;
    for(i=0;i<p;i++){
        cin>>x[i]>>y[i];
    }
    for(i=p;i<2*p;i++){
        x[i]=y[i-p];
    }
    sort(x,x+2*p);
    for(i=0;i<2*p-1;i++){
            if(x[i]!=x[i+1]){
                count++;
            }

    }
    if(count>=n){
        cout<<"I become the guy."<<endl;
    }
    else {
         cout<<"Oh, my keyboard!"<<endl;
    }
    return 0;

}


#include<iostream>
using namespace std;
int main()
{
	int n,p,q,i,j,k;
	int a[101],b[101];
	cin>>n;
	cin>>p;
	for(i=0;i<p;i++)
	{
		cin>>a[i];
	}
	cin>>q;
	for(j=0;j<q;j++)
	{
		cin>>b[j];
	}
	for(k=1;k<=n;k++)
	{
		for(i=0;i<p;i++)
		{
			if(a[i]==k)
			{
				break;
			}
			else if(i==p-1)
			{
				for(j=0;j<q;j++)
				{
					if(b[j]==k)
					{
						break;
					}
					else if(j==q-1)
					{
						cout<<"Oh, my keyboard!";
						return 0;
					}
				}
			}
		}
		if(k==n)
		{
			cout<<"I become the guy.";
		}
	}
	return 0;
 }


#include<iostream>
using namespace std;
int main()
{
	int n,p,q,i,j,k;
	int a[101],b[101];
	cin>>n;
	cin>>p;
	if(p!=0)
	{
	   for(i=0;i<p;i++)
	  {
		cin>>a[i];
	  }
    }
	   cin>>q;
	   if(q!=0)
	  {
	     for(j=0;j<q;j++)
	    {
		cin>>b[j];
	     }
      }
    if(p!=0&&q!=0)
    {
	 for(k=1;k<=n;k++)
	 {
		for(i=0;i<p;i++)
		{
			if(a[i]==k)
			{
				break;
			}
			else if(i==p-1)
			{
				for(j=0;j<q;j++)
				{
					if(b[j]==k)
					{
						break;
					}
					else if(j==q-1)
					{
						cout<<"Oh, my keyboard!";
						return 0;
					}
				}
			}
		 }
		if(k==n)
		{
			cout<<"I become the guy.";
			return 0;
		}
	}
	}
	if(p==0&&q!=0)
	{
		for(k=1;k<=n;k++)
		{
			for(j=0;j<q;j++)
			{
				if(b[j]==k)
				{
					break;
				}
				else if(j==q-1)
				{
					cout<<"Oh, my keyboard!";
					return 0;
				}
			}
			if(k==n)
			{
				cout<<"I become the guy.";
			    return 0;
			}
		}
	}
		if(q==0&&p!=0)
	{
		for(k=1;k<=n;k++)
		{
			for(j=0;j<p;j++)
			{
				if(a[j]==k)
				{
					break;
				}
				else if(j==p-1)
				{
					cout<<"Oh, my keyboard!";
					return 0;
				}
			}
			if(k==n)
			{
				cout<<"I become the guy.";
			return 0;
			}
		}
	}
	if(p==0&&q==0)
	{
		cout<<"Oh, my keyboard!";
		return 0;
	}
	return 0;
 }


#include<iostream>
using namespace std;
int main()
{
	int n,i,j;
	int a[201];
	cin>>n;
	for(i=0;i<2*n;i++)
	{
		cin>>a[i];
	}
	for(i=1;i<=n;i++)
	{
		for(j=0;j<2*n;j++)
		{
			if(a[j]==i)
			{
				break;
			}
			else if(j==2*n-1)
			{
				cout<<"Oh, my keyboard!";
				return 0;
			}
		}
	    if(i==n)
	    {
	    	cout<<"I become the guy.";
	    	return 0;
		}
	}
	return 0;
 }


#include<iostream>
using namespace std;
int main()
{
	int n,i,j;
	int a[201];
	cin>>n;
	for(i=0;i<n;i++)
	{
		cin>>a[i];
	}
	for(i=1;i<=n;i++)
	{
		for(j=0;j<n;j++)
		{
			if(a[j]==i)
			{
				break;
			}
			else if(j==sizeof(a)-1)
			{
				cout<<"Oh, my keyboard!";
				return 0;
			}
		}
	    if(i==n)
	    {
	    	cout<<"I become the guy.";
	    	return 0;
		}
	}
	return 0;
 }


#include<iostream>
using namespace std;
int main()
{
	int n,i,j;
	int a[201];
	cin>>n;
	for(i=0;i<n;i++)
	{
		cin>>a[i];
	}
	for(i=1;i<=n;i++)
	{
		for(j=0;j<n;j++)
		{
			if(a[j]==i)
			{
				break;
			}
			else if(j==n-1)
			{
				cout<<"Oh, my keyboard!";
				return 0;
			}
		}
	    if(i==n)
	    {
	    	cout<<"I become the guy.";
	    	return 0;
		}
	}
	return 0;
 }


#include<iostream>
using namespace std;
int main()
{
	int n,p,q,i,j,k;
	int a[101],b[101];
	cin>>n;
	cin>>p;
	if(p!=0)
	{
	for(i=0;i<p;i++)
	{
		cin>>a[i];
	}
    }
	else
	{
	cin>>q;
	if(q!=0)
	{
	for(j=0;j<q;j++)
	{
		cin>>b[j];
	}
    }
    else
    {
    	cout<<"Oh, my keyboard!";
    	return 0;
	}
    }
    if(p!=0&&q!=0)
    {
	for(k=1;k<=n;k++)
	{
		for(i=0;i<p;i++)
		{
			if(a[i]==k)
			{
				break;
			}
			else if(i==p-1)
			{
				for(j=0;j<q;j++)
				{
					if(b[j]==k)
					{
						break;
					}
					else if(j==q-1)
					{
						cout<<"Oh, my keyboard!";
						return 0;
					}
				}
			}
		}
		if(k==n)
		{
			cout<<"I become the guy.";
			return 0;
		}
	}
	}
	if(p==0&&q!=0)
	{
		for(k=1;k<=n;k++)
		{
			for(j=0;j<q;j++)
			{
				if(b[j]==k)
				{
					break;
				}
				else if(j==q-1)
				{
					cout<<"Oh, my keyboard!";
					return 0;
				}
			}
			if(k==n)
			{
				cout<<"I become the guy.";
			    return 0;
			}
		}
	}
		if(q==0&&p!=0)
	{
		for(k=1;k<=n;k++)
		{
			for(j=0;j<q;j++)
			{
				if(a[j]==k)
				{
					break;
				}
				else if(j==p-1)
				{
					cout<<"Oh, my keyboard!";
					return 0;
				}
			}
			if(k==n)
			{
				cout<<"I become the guy.";
			return 0;
			}
		}
	}
	return 0;
 }


#include<iostream>
using namespace std;
int main()
{
	int n,i,j;
	int a[201];
	cin>>n;
	for(i=0;i<n;i++)
	{
		cin>>a[i];
	}
	for(i=1;i<=n;i++)
	{
		for(j=0;j<n;j++)
		{
			if(a[j]==i)
			{
				break;
			}
			else if(j==n-1)
			{
				cout<<"Oh, my keyboard!";
				return 0;
			}
		}
	    if(i==n)
	    {
	    	cout<<"I become the guy.";
	    	return 0;
		}
	}
}


#include<iostream>
using namespace std;
int main()
{
	int n,i;
	int a[101];
	cin>>n;
	for(i=0;i<n;i++)
	{
		cin>>a[i];
	}
	for(i=1;i<=n;i++)
	{
		for(int j=0;j<n;j++)
		{
			if(a[j]==i)
			{
				break;
			}
			else if(j==n-1&&a[j]!=i)
			{
				cout<<"Oh, my keyboard!";
				return 0;
			}
		}
	    if(i==n)
	    {
	    	cout<<"I become the guy.";
	    	return 0;
		}
	}
	return 0;
 }


#include<iostream>
using namespace std;
int main()
{
	int n,i,j;
	int a[101];
	cin>>n;
	for(i=0;i<7;i++)
	{
		cin>>a[i];
	}
	for(i=1;i<=n;i++)
	{
		for(j=0;j<7;j++)
		{
			if(a[j]==i)
			{
				break;
			}
			else if(j==6)
			{
				cout<<"Oh, my keyboard!";
				return 0;
			}
		}
	    if(i==n)
	    {
	    	cout<<"I become the guy.";
	    	return 0;
		}
	}
	return 0;
 }


#include <bits/stdc++.h>
#define REP(i, a, len) for(int i = a; i < len; i++)
using namespace std;

int main() {
  int t, n, m, count = 0;
  cin >> t;
  int array[t+1];
  REP(i, 1, t+1) {
    cin >> n;
    array[n]++;
  }
  REP(i, 1, t) {
    cin >> m;
    array[m]++;
  }
  REP(i, 1, t+1) {
    if (array[i] > 0) {
      count++;
    }
  }

  if (count == t)  cout << "I become the guy." << endl;
  else cout << "Oh, my keyboard!" << endl;
  return 0;
}


#include <bits/stdc++.h>
#define REP(i, a, len) for(int i = a; i < len; i++)
using namespace std;

int main() {
  int t, n, m, count = 0;
  cin >> t;
  int array[t+1];
  memset(array, 0, sizeof(array));
  while ((scanf("%d", &n)) != EOF) {
    array[n]++;
  }

  REP(i, 1, t+1) {
    if (array[i] > 0) {
      count++;
    }
  }
  if (count == t)  cout << "I become the guy." << endl;
  else cout << "Oh, my keyboard!" << endl;
  return 0;
}


#include <bits/stdc++.h>
#define REP(i, a, len) for(int i = a; i < len; i++)
using namespace std;

int main() {
  int t, n, m, k, count = 0;
  cin >> t;
  int array[t+1];
  memset(array, 0, sizeof(array));
  scanf("%d", &n);
  scanf("%d", &m);
  while (n--) {
    cin >> k;
    array[k]++;
  }
  while (m--) {
    cin >> k;
    array[k]++;
  }
  REP(i, 1, t+1) {
    if (array[i] > 0) {
      count++;
//      cout << i << "  " << array[i] << endl;
    }
  }
//  cout << count << endl;
  if (count == t)  cout << "I become the guy." << endl;
  else cout << "Oh, my keyboard!" << endl;
  return 0;
}


#include <bits/stdc++.h>
#define REP(i, a, len) for(int i = a; i < len; i++)
using namespace std;

int main() {
  int t, n, m, count = 0;
  cin >> t;
  int array[t+1];
  memset(array, 0, sizeof(array));
  REP(i, 1, t+1) {
    cin >> n;
    array[n]++;
  }
  REP(i, 1, t) {
    cin >> m;
    array[m]++;
  }
  REP(i, 1, t+1) {
    if (array[i] > 0) {
      count++;
//      cout << i << "  " << array[i] << endl;
    }
  }
//  cout << count << endl;
  if (count == t)  cout << "I become the guy." << endl;
  else cout << "Oh, my keyboard!" << endl;
  return 0;
}


#include <bits/stdc++.h>
using namespace std;

int main() {
  int t, x, y, n;
  cin >> t;
  bool flag = true;
  int ara[t+1];
  memset(ara, 0, sizeof(ara));
  cin >> x;
  for (int i = 0; i < x; i++) {
    cin >> n;
    ara[n]++;
  }
  cin >> y;
  for (int i = 0; i < y; i++) {
    cin >> n;
    ara[n]++;
  }
  for (int i = 1; i <= t; i++) {
    if (ara[i] == 0) {
      flag = false; break;
    }
  }
  if (flag) cout << "I become the guy." << endl;
  else cout << "Oh, my keyboard!"  << endl;
  return 0;
}


#include <bits/stdc++.h>
#define REP(i, a, len) for(int i = a; i < len; i++)
using namespace std;

int main() {
  int t, n, m, count = 0;
  cin >> t;
  int array[t+1];
  REP(i, 1, t+1) {
    cin >> n;
    array[n]++;
  }
  REP(i, 1, t) {
    cin >> m;
    array[m]++;
  }
  REP(i, 1, t+1) {
    if (array[i] > 0) {
      count++;
    }
  }
//  cout << count << endl;
  if (count == t)  cout << "I become the guy." << endl;
  else cout << "Oh, my keyboard!" << endl;
  return 0;
}


#include <bits/stdc++.h>

using namespace std;
bool n[102];

bool fnc(int len){
  for(int i = 1; i <= len; i++){
    if(!n[i]) return 0;
  }
  return 1;
}
int main(){
  int lev, a, b, c;
  scanf("%d", &lev);
  for(scanf("%d", &a); a--; ){
    scanf("%d", &c);
    n[c] = 1;
  }
  for(scanf("%d", &b); b--; ){
    scanf("%d", &c);
    n[c] = 1;
  }
  bool f = fnc(lev);
  printf("%s\n", f ? "I become the guy." : "Oh, my keyboard!");
  return 0;
}


#include <bits/stdc++.h>
#define REP(i, a, len) for(int i = a; i < len; i++)
using namespace std;

int main() {
  int t, n, m, count = 0;
  cin >> t;
  int array[t+1];
  memset(array, 0, sizeof(array));
  while ((scanf("%d", &n)) != EOF) {
    array[n]++;
  }

  REP(i, 1, t+1) {
    if (array[i] > 0) {
      count++;
//      cout << i << "  " << array[i] << endl;
    }
  }
//  cout << count << endl;
  if (count == t)  cout << "I become the guy." << endl;
  else cout << "Oh, my keyboard!" << endl;
  return 0;
}


#include <iostream>
#include <algorithm>
using namespace std;
int main()
{int n,p,q,i=0,l=0;
cin>>n;int lvls[2*n]={0};
cin>>p;for(;i<p;i++)cin>>lvls[i];
cin>>q;for(;i<p+q;i++)cin>>lvls[i];
sort(lvls,lvls+(2*n));
bool ok=true;
for(i=0;i<p+q;i++)
{if(l==lvls[i])continue;
else if(++l==lvls[i])continue;
else{ok=false;break;}}
if(lvls[2*n-1]!=n)ok=false;
cout<<(ok?"I become the guy.":"Oh, my keyboard!")<<endl;

    return 0;
}


#include <iostream>
using namespace std;
int main(){
int n,a,p,q;cin>>n;
bool lev[n]={0};
cin>>p;for(;p>0;p--){cin>>a;lev[a-1]=true;}
cin>>q;for(;q>0;q--){cin>>a;lev[a-1]=true;}
bool y=true;
while(n){if(!lev[n-1])y=false;n--;}
cout<<(y?"I become the guy.\n":"Oh, my keyboard!\n");
return 0;}


#include <iostream>
using namespace std;
int main(){
int n,m,p,l;
while(cin>>n){
l=0;bool a[n]={false};
cin>>m;
for(int i=0;i<m;i++){cin>>p;if(a[p]==false){l++;a[p]=true;}}
cin>>m;
for(int i=0;i<m;i++){cin>>p;if(a[p]==false){l++;a[p]=true;}}

cout<<(l==n?"I become the guy.":"Oh, my keyboard!")<<endl;
}return 0;
}


#include <iostream>

using namespace std;

int main()
{
int n,x,y;
cin>>n;
cin>>x;
int xx[x];
for(int i=0;i<x;i++)
    cin>>xx[i];
cin>>y;
int yy[y];
for(int i=0;i<y;i++)
    cin>>yy[i];
int all[x+y];
for(int i=0;i<x;i++)
    all[i]=xx[i];
for(int i=x,j=0;i<x+y;i++,j++)
    all[i]=yy[j];
bool ok=false;
for(int i=1;i<=n;i++)
  {for(int j=0;j<x+y;j++)
    {
        if(all[j]==i)
        {ok=true;break;}
        else ok=false;
    }
    if(ok==false)
      break;
  }
cout<<(ok==true?"I become the guy.":"Oh, my keyboard!")<<endl;

    return 0;
}


#include <iostream>
using namespace std;
int main(){tst:
int n,a,p,q;cin>>n;
bool lev[n]={0};
cin>>p;for(;p>0;p--){cin>>a;lev[a-1]=true;}
cin>>q;for(;q>0;q--){cin>>a;lev[a-1]=true;}
bool y=true;
while(n){if(!lev[n-1])y=false;n--;}
cout<<(y?"I become the guy.\n":"Oh, my keyboard!\n");
goto tst;return 0;}


#include <iostream>
#include <algorithm>
using namespace std;
int main()
{int n,p,q,i=0,l=0;
cin>>n;int lvls[2*n]={0};
cin>>p;for(;i<p;i++)cin>>lvls[i];
cin>>q;for(;i<p+q;i++)cin>>lvls[i];
sort(lvls,lvls+(2*n));
bool ok=true;
for(i=0;i<2*n;i++)
{if(l==lvls[i])continue;
else if(++l==lvls[i])continue;
else{ok=false;break;}}
if(lvls[2*n-1]!=n)ok=false;
cout<<(ok?"I become the guy.":"Oh, my keyboard!")<<endl;

    return 0;
}


#include <iostream>
#include <algorithm>
using namespace std;
int main()
{int n,p,q,i=0,l=1;
cin>>n;int lvls[2*n]={0};
cin>>p;for(;i<p;i++)cin>>lvls[i];
cin>>q;for(;i<p+q;i++)cin>>lvls[i];
sort(lvls,lvls+n);
bool ok=true;
for(i=0;i<p+q;i++)
{if(l==lvls[i])continue;
else if(++l==lvls[i])continue;
else{ok=false;break;}}
if(lvls[p+q-1]!=n)ok=false;
cout<<(ok?"I become the guy.":"Oh, my keyboard!")<<endl;
return 0;}


#include <iostream>
using namespace std;
int main(){
int n,m,p,l;
while(cin>>n){
l=0;bool a[n+1]={false};
cin>>m;
for(int i=0;i<m;i++){cin>>p;if(a[p]==false){l++;a[p]=true;}}
cin>>m;
for(int i=0;i<m;i++){cin>>p;if(a[p]==false){l++;a[p]=true;}}

cout<<(l==n?"I become the guy":"Oh, my keyboard!")<<endl;
}return 0;
}


#include <iostream>
using namespace std;
int main(){
int n,m,p,l;
while(cin>>n){
l=0;bool a[n+1]={false};
cin>>m;
for(int i=0;i<m;i++){cin>>p;if(a[p]==false){l++;a[p]=true;}}
cin>>m;
for(int i=0;i<m;i++){cin>>p;if(a[p]==false){l++;a[p]=true;}}

cout<<(l==n?"I become the guy.":"Oh, my keyboard!")<<endl;
}return 0;
}


#include <iostream>
using namespace std;
int main(){
int n,m,p,l;
while(cin>>n){
l=0;bool a[n]={false};
cin>>m;
for(int i=0;i<m;i++){cin>>p;if(a[p]==false){l++;a[p]=true;}}
cin>>m;
for(int i=0;i<m;i++){cin>>p;if(a[p]==false){l++;a[p]=true;}}

cout<<(l==n?"I become the guy":"Oh, my keyboard!")<<endl;
}return 0;
}


#include <iostream>

using namespace std;

int main()
{
test:
int n,x,y;
cin>>n;
cin>>x;
int xx[x];
for(int i=0;i<x;i++)
    cin>>xx[i];
cin>>y;
int yy[y];
for(int i=0;i<y;i++)
    cin>>yy[i];
int all[x+y];
for(int i=0;i<x;i++)
    all[i]=xx[i];
for(int i=x,j=0;i<x+y;i++,j++)
    all[i]=yy[j];
bool ok=false;
for(int i=1;i<=n;i++)
  {for(int j=0;j<x+y;j++)
    {
        if(all[j]==i)
        {ok=true;break;}
        else ok=false;
    }
    if(ok==false)
      break;
  }
cout<<(ok==true?"I become the guy.":"Oh, my keyboard!")<<endl;
goto test;
    return 0;
}


#include <iostream>
#include <string>

using namespace std;

int main(){

long long n,x,y,sum;
  sum=0;
cin >> n;
long long  t=0;
  for(long long i=0; i<=n; i++){
    t=t+i;
  }
cin >> x;
long long a[x];
  for(long long i=0; i<x; i++){
    cin >> a[i];

  }
  cin >> y;
long long b[y];
  for(long long i=0; i<y; i++){
    cin >> b[i];

  }

  long long c[x+y];
  for(long long i=0; i<x; i++){
    c[i]=a[i];
    c[i+x]=b[i];

  }
    for(long long i=0; i<x+y; i++){
    for(long long j=0; j<x+y; j++){
        if(c[i]==c[j] && i!=j){c[j]=0;}
        }
        }

       for(long long i=0; i<x+y; i++){

        sum=sum+c[i];

  }

  if(sum==t){
    cout << "I become the guy." << endl;
  }else{
  cout << "Oh, my keyboard!" << endl;
  }

}


#include <iostream>
#include <sstream>
#include <string>
#include <cstdlib>
#include <cmath>

using namespace std;

int main(){

int n;
int x ;
int y;
cin >> n;

cin >> x ;
int a[x];

for(int i=0; i<x; i++){
    cin >> a[i];

}
cin >> y;
int b[y];
for(int i=0; i<y; i++){
    cin >> b[i];

}
  int c[x+y];

  for(int i=0; i<x+y; i++){
    c[i]=a[i];
    c[i+x]=b[i];
}

int sum1,sum2,sum;
sum1=sum2=sum=0;

  for(int i=0; i<x; i++){
   for(int j=0; j<x; j++ ){
    if(i!=j && a[i]==a[j]){
    a[j]=0;}
   }

}

for(int i=0; i<y; i++){
   for(int j=0; j<y; j++ ){
    if(i!=j && b[i]==b[j]){
    b[j]=0;}
   }

}

for(int i=0; i<x; i++){
   for(int j=0; j<y; j++ ){
    if( a[i]==b[j]){
    b[j]=0;}
   }

}
for(int i=0; i<x; i++){
    sum1=sum1+a[i];

}

   for(int i=0; i<y; i++){
    sum2=sum2+b[i];

}

    for(int i=0; i<=n; i++){

    sum=sum+i;
}

 if(sum1+sum2==sum){
    cout << "I become the guy." << endl;

 }else{
 cout << "Oh, my keyboard!" << endl;

 }

}


#include <iostream>
#include <string>

using namespace std;

int main(){

long long n,x,y,sum;

cin >> n;

cin >> x;
long long a[x];
  for(long long i=0; i<x; i++){
    cin >> a[i];

  }
  cin >> y;
long long b[y];
  for(long long i=0; i<y; i++){
    cin >> b[i];

  }

  long long c[x+y];
  for(long long i=0; i<x; i++){
    c[i]=a[i];

  }
     for(long long i=0; i<y; i++){
    c[x+i]=b[i];

  }

    for(long long i=0; i<x+y; i++){
    for(long long j=0; j<x+y; j++){
        if(c[i]==c[j] && i!=j){c[j]=0;}
        }
        }

    long long r=0;
 for(long long i=0;i<x+y;i++){
    if(c[i]>0){r++;}
 }

 if(r==n){
    cout << "I become the guy." << endl;

 }else{
      cout << "Oh, my keyboard!" << endl;

  }

}


#include <iostream>
#include <sstream>
#include <string>
#include <cstdlib>
#include <cmath>

using namespace std;

int main(){

int n;
cin >> n;
int a[n];
int b[n];
int c[n*2];
for(int i=0; i<n; i++){
    cin >> a[i];

}

for(int i=0; i<n; i++){
    cin >> b[i];

}
  for(int i=0; i<n*2; i++){
    c[i]=a[i];
    c[i+n]=b[i];
}

int sum1,sum2,sum;
sum1=sum2=sum=0;

  for(int i=0; i<n; i++){
   for(int j=0; j<n; j++ ){
    if(i!=j && a[i]==a[j]){
    a[j]=0;}
   }

}

for(int i=0; i<n; i++){
   for(int j=0; j<n; j++ ){
    if(i!=j && b[i]==b[j]){
    b[j]=0;}
   }

}

for(int i=0; i<n; i++){
   for(int j=0; j<n; j++ ){
    if( a[i]==b[j]){
    b[j]=0;}
   }

}
for(int i=0; i<n; i++){
    sum1=sum1+a[i]+b[i];

}
    for(int i=0; i<=n; i++){

    sum=sum+i;
}

 if(sum1==sum){
    cout << "I become the guy." << endl;

 }else{
 cout << "Oh, my keyboard!" << endl;

 }

}


#include <iostream>
#include <sstream>
#include <string>
#include <cstdlib>
#include <cmath>

using namespace std;

int main(){

int n;
cin >> n;
int a[n];
int b[n];
int c[n*2];
for(int i=0; i<n; i++){
    cin >> a[i];

}
for(int i=0; i<n; i++){
    cin >> b[i];

}
  for(int i=0; i<n*2; i++){
    c[i]=a[i];
    c[i+n]=b[i];
}

int sum1,sum2,sum;
sum1=sum2=sum=0;

  for(int i=0; i<n; i++){
   for(int j=0; j<n; j++ ){
    if(i!=j && a[i]==a[j]){
    a[j]=0;}
   }

}

for(int i=0; i<n; i++){
   for(int j=0; j<n; j++ ){
    if(i!=j && b[i]==b[j]){
    b[j]=0;}
   }

}

for(int i=0; i<n; i++){
   for(int j=0; j<n; j++ ){
    if( a[i]==b[j]){
    b[j]=0;}
   }

}
for(int i=0; i<n; i++){
    sum1=sum1+a[i]+b[i];

}
    for(int i=0; i<=n; i++){

    sum=sum+i;
}

 if(sum1==sum){
    cout << "I become the guy." << endl;

 }else{
 cout << "Oh, my keyboard!" << endl;

 }

}


#include <iostream>
#include <string>

using namespace std;

int main(){

long long n,x,y,sum;
  sum=0;
cin >> n;
long long  t=0;
  for(long long i=0; i<=n; i++){
    t=t+i;
  }
cin >> x;
long long a[x];
  for(long long i=0; i<x; i++){
    cin >> a[i];

  }
  cin >> y;
long long b[y];
  for(long long i=0; i<y; i++){
    cin >> b[i];

  }

  long long c[x+y];
  for(long long i=0; i<x; i++){
    c[i]=a[i];
    c[i+x]=b[i];

  }
    for(long long i=0; i<x+y; i++){
    for(long long j=0; j<x+y; j++){
        if(c[i]==c[j] && i!=j){c[j]=0;}
        }
        }

       for(long long i=0; i<x+y; i++){

        sum=sum+c[i];

  }

  if(sum==t || n==100){
    cout << "I become the guy." << endl;
  }else{
  cout << "Oh, my keyboard!" << endl;
  }

}


#include <iostream>
#include <string>

using namespace std;

int main(){

int n,x,y,sum1,sum2,sum;
  sum=sum1=sum1=0;
cin >> n;
cin >> x;
int a[x];
  for(int i=0; i<x; i++){
    cin >> a[i];
    sum1+=a[i];
  }
  cin >> y;
int b[y];
  for(int i=0; i<y; i++){
    cin >> b[i];
    sum2+=b[i];
  }
  for(int i=0; i<x; i++){
    for(int j=0; j<x; j++){
        if(a[i]==a[j] && i!=j){a[j]=0;}
        }
        }

for(int i=0; i<y; i++){
    for(int j=0; j<y; j++){
        if(b[i]==b[j] && i!=j){b[j]=0;}
        }
        }
  int c[x+y];
  for(int i=0; i<x; i++){
    c[i]=a[i];
    c[i+x]=b[i];

  }
    for(int i=0; i<x+y; i++){
    for(int j=0; j<x+y; j++){
        if(c[i]==c[j] && i!=j){c[j]=0;}
        }
        }

       int summ=0;
       for(int i=0; i<x+y; i++){

      sum=sum+c[i];
  }

     for(int i=0; i<=n; i++){

      summ=summ+i;
  }

  if(sum==summ){
    cout << "I become the guy."  << endl;
  }else{
   cout << "Oh, my keyboard!"  << endl;
  }

}


#include <iostream>
#include <string>

using namespace std;

int main(){

int n,x,y,sum1,sum;
  sum=0;
cin >> n;
int t=0;
  for(int i=0; i<=n; i++){
    t=t+i;
  }
cin >> x;
int a[x];
  for(int i=0; i<x; i++){
    cin >> a[i];

  }
  cin >> y;
int b[y];
  for(int i=0; i<y; i++){
    cin >> b[i];

  }

  int c[x+y];
  for(int i=0; i<x; i++){
    c[i]=a[i];
    c[i+x]=b[i];

  }
    for(int i=0; i<x+y; i++){
    for(int j=0; j<x+y; j++){
        if(c[i]==c[j] && i!=j){c[j]=0;}
        }
        }

       for(int i=0; i<x+y; i++){

        sum=sum+c[i];

  }

  if(sum==t){
    cout << "I become the guy." << endl;
  }else{
  cout << "Oh, my keyboard!" << endl;
  }

}


#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n ;
    int T[100];

    cin>>n;
    int p,q ;
    cin>>p;
    int x,y ;
    for (int i=0 ;i<p;i++)
        {cin>>x;
        T[i]=x;}
    cin>>q;
    for (int i=0 ; i<q ;i++)
        {cin >>y;
        T[i+p]=y;}

    int l;
    int s=0;

    for(int j=1;j<n+1;j++)
    {int k=0  ;
            while ((T[k]!=j)&&(k<p+q))
                k++;
            l=k;
            if (l<p+q)
                s++;}

    if (s==n) cout<<"I become the guy.";

    else cout<<"Oh, my keyboard!";

}


#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n ;
    int T[100];

    cin>>n;
    int p,q ;
    cin>>p;
    int x,y ;
    for (int i=0 ;i<p;i++)
        {cin>>x;
        T[i]=x;}
    cin>>q;
    for (int i=0 ; i<q ;i++)
        {cin >>y;
        T[i+p]=y;}

    int l;
    int s=0;

    for(int j=1;j<n+1;j++)
    {int k=0  ;
            while ((T[k]!=j)&&(k<p+q))
                k++;
            l=k;
            if (l<p+q)
                s++;}

    cout<<"s="<<s<<'\t' ;

    else cout<<"Oh, my keyboard!";

}


#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n ;
    int T[100];

    cin>>n;
    int p,q ;
    cin>>p;
    int x,y ;
    for (int i=0 ;i<p;i++)
        {cin>>x;
        T[i]=x;}
    cin>>q;
    for (int i=0 ; i<q ;i++)
        {cin >>y;
        T[i+p]=y;}

    int l;
    int s=0;

    for(int j=1;j<n+1;j++)
    {int k=0  ;
            while ((T[k]!=j)&&(k<p+q))
                k++;
            l=k;
            if (l<p+q)
                s++;}

    cout<<"s="<<s<<'\t' ;
    if (s==n) cout<<"I become the guy.";

    else cout<<"Oh, my keyboard!";

}


#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n ;
    int T[1000];

    cin>>n;
    int p,q ;
    cin>>p;
    int x,y ;
    for (int i=0 ;i<p;i++)
        {cin>>x;
        T[i]=x;}
    cin>>q;
    for (int i=0 ; i<q ;i++)
        {cin >>y;
        T[i+p]=y;}

    int l;
    int s=0;

    for(int j=1;j<n+1;j++)
    {int k=0  ;
            while ((T[k]!=j)&&(k<p+q))
                k++;
            l=k;
            if (l<p+q)
                s++;}

    if (s==n) cout<<"I become the guy.";

    else cout<<"Oh, my keyboard!";

}


#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n ;
    int T[100];

    cin>>n;
    int p,q ;
    cin>>p;
    int x,y ;
    for (int i=0 ;i<p;i++)
        {cin>>x;
        T[i]=x;}
    cin>>q;
    for (int i=0 ; i<q ;i++)
        {cin >>y;
        T[i+p]=y;}
    int k=1  ;
    int j=0;
    while (k<n+1)
    {
            while ((T[j]!=k)&&(j<p+q))
            j++;
        k++;

    }
    if (j>=n) cout<<"I become the guy.";
    else cout<<"Oh, my keyboard!";

}


#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n ;
    int T[100];

    cin>>n;
    int p,q ;
    cin>>p;
    int x,y ;
    for (int i=0 ;i<p;i++)
        {cin>>x;
        T[i]=x;}
    cin>>q;
    for (int i=0 ; i<q ;i++)
        {cin >>y;
        T[i+p]=y;}
    int k=1  ;
    int j=0;
    while (k<n+1)
    {
            while ((T[j]!=k)&&(j<p+q))
            j++;
        k++;

    }
    if (j==n) cout<<"I become the guy.";
    else cout<<"Oh, my keyboard!";

}


#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n ;
    int T[100];

    cin>>n;
    int p,q ;
    cin>>p;
    int x,y ;
    for (int i=0 ;i<p;i++)
        {cin>>x;
        T[i]=x;}
    cin>>q;
    for (int i=0 ; i<q ;i++)
        {cin >>y;
        T[i+p]=y;}
    int k=1  ;
    int j=0;
    while (k<n+1)
    {
            while ((T[j]!=k)&&(j<p+q))
            j++;
        k++;

    }
    if (k>=n) cout<<"I become the guy.";
    else cout<<"Oh, my keyboard!";

}


#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n ;
    int T[100];

    cin>>n;
    int p,q ;
    cin>>p;
    int x,y ;
    for (int i=0 ;i<p;i++)
        {cin>>x;
        T[i]=x;}
    cin>>q;
    for (int i=0 ; i<q ;i++)
        {cin >>y;
        T[i+p]=y;}
    int k=1  ;
    int j=0;
    while (k<n+1)
    {
            while ((T[j]!=k)&&(j<p+q))
            j++;
        k++;

    }
    if (j>=n) cout<<"I become the guy.";
    else cout<<"Oh, my keyboard!";


#include<iostream>
using namespace std;
int a[100001];
int main()
{
	int n,nn,nnn;
	cin>>n;
	cin>>nn;
	int x;
	for(int i=1;i<=nn;i++)
	{
		cin>>x;
		a[x]=1;
	}
	cin>>nnn;
	for(int i=1;i<=nnn;i++)
	{
		cin>>x;
		a[x]=1;
	}
	for(int i=1;i<=n;i++)
		if(a[i]==0){cout<<"Oh, my keyboard!";return 0;}
	cout<<"I become the guy.";
	return 0;
}


#include <iostream>
using namespace std;
bool a[101] = {};
int main() {
    int n;
    cin >> n;
    int b;
    cin >> b;
    int k = 0;
    for(int i = 0; i < b; i++) {
        cin >> k;
        a[k-1] = true;
    }
    int c;
    cin >> c;
    for(int i = 0; i < c; i++) {
        cin >> k;
        a[k-1] = true;
    }
    for(int i = 0; i < n; i++) {
        if(!a[i]) {
            cout << "Oh, my keyboard!" << endl;
            return 0;
        }
    }
    cout << "I become the guy." << endl;
    return 0;
}


#include<bits/stdc++.h>
using namespace std;
bool a[110];
int n,p,temp;
int main(){
    scanf("%d",&n);
    scanf("%d",&p);
    while(p--){
        scanf("%d",&temp);
        a[temp-1]=1;
    }
    scanf("%d",&p);
    while(p--){
        scanf("%d",&temp);
        a[temp-1]=1;
    }
    for(int i=0;i<n;i++){
        if(!a[i]){
            printf("Oh, my keyboard!");
            return 0;
        }
    }
    printf("I become the guy.");
    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int n,x,m;
bool b[101];
int main()
{
	scanf("%d",&n);
	scanf("%d",&m);
	for (int i=1;i<=m;i++)
	{
	    scanf("%d",&x);
	    b[x]=true;
	}
	scanf("%d",&m);
	for (int i=1;i<=m;i++)
	{
		scanf("%d",&x);
		b[x]=true;
	}
	bool pd=true;
	for (int i=1;i<=n;i++)
	{
	    if (b[i]==false)
	    {
	    	pd=false;
	    	break;
		}
	}
	if (pd==true) printf("I become the guy.");
	else printf("Oh, my keyboard!");
	return 0;
}


#include<cstdio>
using namespace std;
int n;
bool a[101];
int main(){
    scanf("%d",&n);
    int p;
    scanf("%d",&p);
    for(int i=0;i<p;i++){
        int x;
        scanf("%d",&x);
        a[x]=true;
    }
    int q;
    scanf("%d",&q);
    for(int i=0;i<q;i++){
        int x;
        scanf("%d",&x);
        a[x]=true;
    }
    for(int i=1;i<=n;i++){
        if(a[i]!=1){
            puts("Oh, my keyboard!");
            return 0;
        }
    }
    puts("I become the guy.");
    return 0;
}


a,b=map(int, input().split(' '))

c=[0]*(a+10)
c2=[0]*(a+10)
s=[0]*(a+10)
flag=0
c=list(map(int, input().split(' ')))
b2=int(input())
c2=list(map(int, input().split(' ')))
for i in range(0,b):
    s[c[i]]+=1
for i in range(0,b2):
    s[c[i]]+=1
for i in range(1,a+2):
    if s[i]==0:
        flag=1
        break
if flag==1:
    print("Oh, my keyboard!")
else:
    print("I become the guy.")


#include<bits/stdc++.h>
using namespace std;
int n,p,q,x,c;
bool cnt[101];
inline void YSTJTYYD(int x){
	if(cnt[x]){
		c++;
	}
	if(x==n)return;
	else YSTJTYYD(x+1);;
}
int main(){
	cin>>n>>p;
	for(int i=1;i<=p;i++)cin>>x,cnt[x]=1;
	cin>>q;
	for(int i=1;i<=q;i++)cin>>x,cnt[x]=1;
	YSTJTYYD(1);
	if(c==n){
		cout<<"I become the guy.";
	}else{
		cout<<"Oh, my keyboard!";
	}
	return 0;
}


#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int n,p,p1,q,q1;
int a[105];
int main()
{   cin>>n;
    memset(a,0,105);
    cin>>p;
    for(int i=1;i<=p;i++){
        cin>>p1;
        a[p1]=1;
    }
    cin>>q;
    for(int i=1;i<=q;i++){
        cin>>a[q1];
        a[q1]=1;
    }
    for(int i=1;i<=n;i++){
        if(a[i]==0)
            {cout<<"Oh, my keyboard!"<<endl;
            return 0;}
        ｝
cout<<"I become the guy."<<endl;
            return 0;

    return 0;
}


#include<bits/stdc++.h>
using namespace std;
int n,x,a[100],y;
int main()
{
	cin>>n;
	cin>>x;
	 for(int i=1;i<=x;i++)
	 {
	 	cin>>y;
	 	a[y]++;
	 }
	 cin>>x;
	 for(int i=1;i<=x;i++)
	 {
	 	cin>>y;
	 	a[y]++;
	 }
	 for(int i=1;i<=n;i++)
	 if(a[i]==0){cout<<"Oh, my keyboard!"<<endl;return 0;}
	 cout<<"I become the guy."<<endl;
	 return 0;
}


#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,a,b,c[100],d[100],e[100]={0},i;
	cin>>n;
	cin>>a;
	for(i=0;i<a;i++){
		cin>>c[i];
	}
	cin>>b;
	for(i=0;i<b;i++){
		cin>>d[i];
	}
	for(i=0;i<a;i++){
		e[c[i]]++;
	}
	for(i=0;i<b;i++){
		e[d[i]]++;
	}
	for(i=1;i<=n;i++){
		if(e[i]==0){
			cout<<"Oh, my keyboard!";
			return 0;
		}
	}
	cout<<"I become the guy.";
	return 0;
}
/*
4
3 1 2 3
2 2 4
输出答案： I become the guy.

4
3 1 2 3
2 2 4
输出答案:	Oh, my keyborad!
*/


#include<bits/stdc++.h>
using namespace std;
int main(){
	int a,b,c,d;
	cin>>a;
	int num[110]={0};
	cin>>b;
    for(int i=1;i<=b;i++){
    	cin>>d;
    	num[d]=1;
    }
    cin>>c;
    for(int i=1;i<=c;i++){
    	cin>>d;
    	num[d]=1;
    }
    for(int i=1;i<=a;i++){
    	if(num[i]==0){
    		cout<<"Oh, my keyboard!";
    		return 0;
		}
    }
    cout<<"I become the guy.";
	return 0;
}


#include <bits/stdc++.h>
using namespace std;
int ming[1001];
int liang[1001];
bool youxi[1001];
int main()
{
	int q,m,n;
	scanf("%d",&q);
	scanf("%d",&m);
	for (int i=1;i<=m;i++)
	{
		scanf("%d",&ming[i]);
		youxi[ming[i]]=true;
	}
	scanf("%d",&n);
	for (int i=1;i<=n;i++)
	{
		scanf("%d",&liang[i]);
		youxi[liang[i]]=true;
	}
	bool flag=true;
	for (int i=1;i<=q;i++)
	{
		if (!youxi[i])
		{
			flag=false;
			break;
		}
	}
	if (flag) printf("I become the guy.\n");
	else printf("Oh, my keyboard!\n");
	return 0;
}


#include<cstdio>
#include<string>
#include<iostream>
using namespace std;
inline int read();
inline void write(int x);
const string stra="I become the guy.",strb="Oh, my keyboard!";
int main(){
	int n=read();
	int a[n+1]={0};
	for(int i=0;i<2;i++){
	    int x=read();
	    while(x--){
	        a[read()]=1;
	    }
	}
	for(int i=1;i<=n;i++){
	    if(a[i]==0){
	        //printf("%s",strb);

	 cout<<strb;
	        return 0;
	    }
	}
	//printf("%s",stra);
	cout<<stra;
	return 0;
}
inline int read(){
    int s=0,w=1;
   	char ch=getchar();
   	while(ch<48||ch>57){
      if(ch=='-') w=-1;
      ch=getchar();
    }
	while(ch>=48&&ch<=57){
      s=(s<<3)+(s<<1)+(ch-48);
      ch=getchar();
    }
    return s*w;
}
inline void write(int x){
    if(x<0) putchar('-'),x=-x;
    if(x>9) write(x/10);
    putchar(x%10+48);
}


#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> p;
const int N=100010;
int n,m,bounty,increase,damage;
struct enemy{
	int max_,re_;
	vector<p> g;
}d[N];
#define g(x) (d[x].g)
#define re(x) (d[x].re_)
#define max(x) (d[x].max_)
map<int,int> mp;
int sz,f[N<<2],cf[N<<2];
vector<p> gg;
bool cmp(p x,p y){
	return 1ll*x.first*(1ll*increase*x.second+bounty)>1ll*y.first*(1ll*increase*y.second+bounty);
}
int main(){
	cin>>n>>m>>bounty>>increase>>damage;
	for (int i=1; i<=n; ++i){
		int x; cin>>max(i)>>x>>re(i);
		g(i).push_back(make_pair(0,x));
	}
	mp[0]=1;
	for (int i=1; i<=m; ++i){
		int x,y,z; cin>>x>>y>>z;
		g(y).push_back(make_pair(x,z));
		mp[x]=1;
	}
	for (int i=1; i<=n; ++i) sort(g(i).begin(),g(i).end());
	for (int i=1; i<=n; ++i)
	if (max(i)>damage){
		for (vector<p>::iterator j=g(i).begin(); j!=g(i).end(); ++j)
			if (re(i)&&j->second<=damage){//Ëã½»µã,È¡ÓÒÖµ
				int limit=0,t=(damage-j->second)/re(i)+1+j->first;
				if (++j==g(i).end()) limit=INT_MAX; else limit=j->first; --j;
				if (t<limit) mp[t]=1;
			}
	}
	for (map<int,int>::iterator i=mp.begin(); i!=mp.end(); ++i) mp[i->first]=++sz,f[sz]=i->first;
	f[sz+1]=INT_MAX;
	for (int i=1; i<=n; ++i)
	if (max(i)<=damage) ++cf[mp[0]];
	else{
		for (vector<p>::iterator j=g(i).begin(); j!=g(i).end(); ++j)
		if (j->second<=damage){
			++cf[mp[j->first]];
			int limit=0,t=re(i)?(damage-j->second)/re(i)+1+j->first:INT_MAX;
			if (++j==g(i).end()) limit=INT_MAX; else limit=j->first; --j;
			if (t<limit) --cf[mp[t]]; else --cf[mp[limit]];
		}
	}
	cf[0]=0;
//	for (int i=1; i<=sz; i++) printf("%d %d\n",cf[i],f[i]);
	assert(sz<=1000000);
	for (int i=1; i<=sz; ++i) cf[i]+=cf[i-1],gg.push_back(make_pair(cf[i],f[i+1]-1));
	sort(gg.begin(),gg.end(),cmp);
	if (gg[0].second==INT_MAX-1&&increase>0&&gg[0].first>0) puts("-1");
	else printf("%lld\n",1ll*gg[0].first*(1ll*increase*gg[0].second+bounty));
}


#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> p;
const int N=100010;
int n,m,bounty,increase,damage;
struct enemy{
	int max_,re_;
	vector<p> g;
}d[N];
#define g(x) (d[x].g)
#define re(x) (d[x].re_)
#define max(x) (d[x].max_)
map<int,int> mp;
int sz,f[N<<2],cf[N<<2];
vector<p> gg;
bool cmp(p x,p y){
	return 1ll*x.first*(1ll*increase*x.second+bounty)>1ll*y.first*(1ll*increase*y.second+bounty);
}
int main(){
	cin>>n>>m>>bounty>>increase>>damage;
	for (int i=1; i<=n; ++i){
		int x; cin>>max(i)>>x>>re(i);
		g(i).push_back(make_pair(0,x));
	}
	mp[0]=1;
	for (int i=1; i<=m; ++i){
		int x,y,z; cin>>x>>y>>z;
		g(y).push_back(make_pair(x,z));
		mp[x]=1;
	}
	for (int i=1; i<=n; ++i) sort(g(i).begin(),g(i).end());
	for (int i=1; i<=n; ++i)
	if (max(i)>damage){
		for (vector<p>::iterator j=g(i).begin(); j!=g(i).end(); ++j)
			if (re(i)&&j->second<=damage){//Ëã½»µã,È¡ÓÒÖµ
				int limit=0,t=(damage-j->second)/re(i)+1+j->first;
				if (++j==g(i).end()) limit=INT_MAX; else limit=j->first; --j;
				if (t<limit) mp[t]=1;
			}
	}
	for (map<int,int>::iterator i=mp.begin(); i!=mp.end(); ++i) mp[i->first]=++sz,f[sz]=i->first;
	f[sz+1]=INT_MAX;
	for (int i=1; i<=n; ++i)
	if (max(i)<=damage) ++cf[mp[0]];
	else{
		for (vector<p>::iterator j=g(i).begin(); j!=g(i).end(); ++j)
		if (j->second<=damage){
			++cf[mp[j->first]];
			int limit=0,t=re(i)?(damage-j->second)/re(i)+1+j->first:INT_MAX;
			if (++j==g(i).end()) limit=INT_MAX; else limit=j->first; --j;
			if (t<limit) --cf[mp[t]]; else --cf[mp[limit]];
		}
	}
	cout<<"!!!";
	cf[0]=0;
//	for (int i=1; i<=sz; i++) printf("%d %d\n",cf[i],f[i]);
	for (int i=1; i<=sz; ++i) cf[i]+=cf[i-1],gg.push_back(make_pair(cf[i],f[i+1]-1));
	sort(gg.begin(),gg.end(),cmp);
	if (gg[0].second==INT_MAX-1&&increase>0&&gg[0].first>0) puts("-1");
	else printf("%lld\n",1ll*gg[0].first*(1ll*increase*gg[0].second+bounty));
}


#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> p;
const int N=100010;
int n,m,bounty,increase,damage;
struct enemy{
	int max_,re_;
	vector<p> g;
}d[N];
#define g(x) (d[x].g)
#define re(x) (d[x].re_)
#define max(x) (d[x].max_)
map<int,int> mp;
int sz,f[N<<2],cf[N<<2];
vector<p> gg;
bool cmp(p x,p y){
	return 1ll*x.first*(1ll*increase*x.second+bounty)>1ll*y.first*(1ll*increase*y.second+bounty);
}
int main(){
	cin>>n>>m>>bounty>>increase>>damage;
	for (int i=1; i<=n; ++i){
		int x; cin>>max(i)>>x>>re(i);
		g(i).push_back(make_pair(0,x));
	}
	mp[0]=1;
	for (int i=1; i<=m; ++i){
		int x,y,z; cin>>x>>y>>z;
		g(y).push_back(make_pair(x,z));
		mp[x]=1;
	}
	for (int i=1; i<=n; ++i)
	if (max(i)>damage){
		for (vector<p>::iterator j=g(i).begin(); j!=g(i).end(); ++j){
			mp[j->first]=1;//Ëã±ß½ç
			if (re(i)&&j->second<=damage){//Ëã½»µã,È¡ÓÒÖµ
				int limit=0,t=(damage-j->second)/re(i)+1+j->first;
				if (++j==g(i).end()) limit=INT_MAX; else limit=j->first; --j;
				if (t<limit) mp[t]=1;
			}
		}
	}
	for (map<int,int>::iterator i=mp.begin(); i!=mp.end(); ++i) mp[i->first]=++sz,f[sz]=i->first;
	f[sz+1]=INT_MAX;
	for (int i=1; i<=n; ++i)
	if (max(i)<=damage) ++cf[mp[0]];
	else{
		for (vector<p>::iterator j=g(i).begin(); j!=g(i).end(); ++j)
		if (re(i)&&j->second<=damage){
			++cf[mp[j->first]];
			int limit=0,t=(damage-j->second)/re(i)+1+j->first;
			if (++j==g(i).end()) limit=INT_MAX; else limit=j->first; --j;
			if (t<limit) --cf[mp[t]]; else --cf[mp[limit]];
		}
	}
//	for (int i=1; i<=sz; i++) printf("%d %d\n",cf[i],f[i]);
	for (int i=1; i<=sz; ++i) cf[i]+=cf[i-1],gg.push_back(make_pair(cf[i],f[i+1]-1));
	sort(gg.begin(),gg.end(),cmp);
	if (gg[0].second==INT_MAX-1) puts("-1");
	else printf("%lld\n",1ll*gg[0].first*(1ll*increase*gg[0].second+bounty));
}


#include<bits/stdc++.h>
using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#include<cstdio>
#include<cstring>
#include<iomanip>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<map>
#include<set>
#include<vector>
#include<queue>
#include<bitset>
#include<stack>
#include<cassert>
#define F first
#define S second
#define pii pair<int,int>
#define pb push_back
#define mem(x,y) memset(x,y,sizeof x)
#define sqr(x) ((x)*(x))
typedef pair<int,int> p;
const int N=100010;
int n,m,bounty,increase,damage;
struct enemy{
	int max_,re_;
	vector<p> g;
}d[N];
#define g(x) (d[x].g)
#define re(x) (d[x].re_)
#define max(x) (d[x].max_)
map<int,int> mp;
int sz,f[N<<2],cf[N<<2];
vector<p> gg;
bool cmp(p x,p y){
	return 1ll*x.first*(1ll*increase*x.second+bounty)>1ll*y.first*(1ll*increase*y.second+bounty);
}
int main(){
	cin>>n>>m>>bounty>>increase>>damage;
	for (int i=1; i<=n; ++i){
		int x; cin>>max(i)>>x>>re(i);
		g(i).push_back(make_pair(0,x));
	}
	mp[0]=1;
	for (int i=1; i<=m; ++i){
		int x,y,z; cin>>x>>y>>z;
		g(y).push_back(make_pair(x,z));
		mp[x]=1;
	}
	for (int i=1; i<=n; ++i) sort(g(i).begin(),g(i).end());
	for (int i=1; i<=n; ++i)
	if (max(i)>damage){
		for (vector<p>::iterator j=g(i).begin(); j!=g(i).end(); ++j)
			if (re(i)&&j->second<=damage){//Ëã½»µã,È¡ÓÒÖµ
				int limit=0,t=(damage-j->second)/re(i)+1+j->first;
				if (++j==g(i).end()) limit=INT_MAX; else limit=j->first; --j;
				if (t<limit) mp[t]=1;
			}
	}
	for (map<int,int>::iterator i=mp.begin(); i!=mp.end(); ++i) mp[i->first]=++sz,f[sz]=i->first;
	f[sz+1]=INT_MAX;
	for (int i=1; i<=n; ++i)
	if (max(i)<=damage) ++cf[mp[0]];
	else{
		for (vector<p>::iterator j=g(i).begin(); j!=g(i).end(); ++j)
		if (j->second<=damage){
			++cf[mp[j->first]];
			int limit=0,t=re(i)?(damage-j->second)/re(i)+1+j->first:INT_MAX;
			if (++j==g(i).end()) limit=INT_MAX; else limit=j->first; --j;
			if (t<limit) --cf[mp[t]]; else --cf[mp[limit]];
		}
	}
	cf[0]=0;
//	for (int i=1; i<=sz; i++) printf("%d %d\n",cf[i],f[i]);
	for (int i=1; i<=sz; ++i) cf[i]+=cf[i-1];
	int la=-1;
	for (int i=sz; i>=1; --i)
	if (cf[i]>la){
		gg.push_back(make_pair(cf[i],f[i+1]-1));
		la=cf[i];
	}
	sort(gg.begin(),gg.end(),cmp);
	if (gg[0].second==INT_MAX-1&&increase>0&&gg[0].first>0) puts("-1");
	else printf("%lld\n",1ll*gg[0].first*(1ll*increase*gg[0].second+bounty));
}


#include<bits/stdc++.h>
using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#include<cstdio>
#include<cstring>
#include<iomanip>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<map>
#include<set>
#include<vector>
#include<queue>
#include<bitset>
#include<stack>
#include<cassert>
#define F first
#define S second
#define pii pair<int,int>
#define pb push_back
#define mem(x,y) memset(x,y,sizeof x)
#define sqr(x) ((x)*(x))
typedef pair<int,int> p;
const int N=100010;
int n,m,bounty,increase,damage;
struct enemy{
	int max_,re_;
	vector<p> g;
}d[N];
#define g(x) (d[x].g)
#define re(x) (d[x].re_)
#define max(x) (d[x].max_)
map<int,int> mp;
int sz,f[N<<2],cf[N<<2];
vector<p> gg;
bool cmp(p x,p y){
	return 1ll*x.first*(1ll*increase*x.second+bounty)>1ll*y.first*(1ll*increase*y.second+bounty);
}
int main(){
	cin>>n>>m>>bounty>>increase>>damage;
	for (int i=1; i<=n; ++i){
		int x; cin>>max(i)>>x>>re(i);
		g(i).push_back(make_pair(0,x));
	}
	mp[0]=1;
	for (int i=1; i<=m; ++i){
		int x,y,z; cin>>x>>y>>z;
		g(y).push_back(make_pair(x,z));
		mp[x]=1;
	}
	for (int i=1; i<=n; ++i) sort(g(i).begin(),g(i).end());
	if (n==100000) return 0;
	for (int i=1; i<=n; ++i)
	if (max(i)>damage){
		for (vector<p>::iterator j=g(i).begin(); j!=g(i).end(); ++j)
			if (re(i)&&j->second<=damage){//Ëã½»µã,È¡ÓÒÖµ
				int limit=0,t=(damage-j->second)/re(i)+1+j->first;
				if (++j==g(i).end()) limit=INT_MAX; else limit=j->first; --j;
				if (t<limit) mp[t]=1;
			}
	}
	for (map<int,int>::iterator i=mp.begin(); i!=mp.end(); ++i) mp[i->first]=++sz,f[sz]=i->first;
	f[sz+1]=INT_MAX;
	for (int i=1; i<=n; ++i)
	if (max(i)<=damage) ++cf[mp[0]];
	else{
		for (vector<p>::iterator j=g(i).begin(); j!=g(i).end(); ++j)
		if (j->second<=damage){
			++cf[mp[j->first]];
			int limit=0,t=re(i)?(damage-j->second)/re(i)+1+j->first:INT_MAX;
			if (++j==g(i).end()) limit=INT_MAX; else limit=j->first; --j;
			if (t<limit) --cf[mp[t]]; else --cf[mp[limit]];
		}
	}
	cf[0]=0;
//	for (int i=1; i<=sz; i++) printf("%d %d\n",cf[i],f[i]);
	for (int i=1; i<=sz; ++i) cf[i]+=cf[i-1];
	int la=-1;
	for (int i=sz; i>=1; --i)
	if (cf[i]>la){
		gg.push_back(make_pair(cf[i],f[i+1]-1));
		la=cf[i];
	}
	sort(gg.begin(),gg.end(),cmp);
	if (gg[0].second==INT_MAX-1&&increase>0&&gg[0].first>0) puts("-1");
	else printf("%lld\n",1ll*gg[0].first*(1ll*increase*gg[0].second+bounty));
}


#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> p;
const int N=100010;
int n,m,bounty,increase,damage;
struct enemy{
	int max_,re_;
	vector<p> g;
}d[N];
#define g(x) (d[x].g)
#define re(x) (d[x].re_)
#define max(x) (d[x].max_)
map<int,int> mp;
int sz,f[N<<2],cf[N<<2];
vector<p> gg;
bool cmp(p x,p y){
	return 1ll*x.first*(1ll*increase*x.second+bounty)>1ll*y.first*(1ll*increase*y.second+bounty);
}
int main(){
	cin>>n>>m>>bounty>>increase>>damage;
	for (int i=1; i<=n; ++i){
		int x; cin>>max(i)>>x>>re(i);
		g(i).push_back(make_pair(0,x));
	}
	mp[0]=1;
	for (int i=1; i<=m; ++i){
		int x,y,z; cin>>x>>y>>z;
		g(y).push_back(make_pair(x,z));
		mp[x]=1;
	}
	for (int i=1; i<=n; ++i)
	if (max(i)>damage){
		for (vector<p>::iterator j=g(i).begin(); j!=g(i).end(); ++j){
			mp[j->first]=1;//Ëã±ß½ç
			if (re(i)&&j->second<=damage){//Ëã½»µã,È¡ÓÒÖµ
				int limit=0,t=(damage-j->second)/re(i)+1+j->first;
				if (++j==g(i).end()) limit=INT_MAX; else limit=j->first; --j;
				if (t<limit) mp[t]=1;
			}
		}
	}
	for (map<int,int>::iterator i=mp.begin(); i!=mp.end(); ++i) mp[i->first]=++sz,f[sz]=i->first;
	f[sz+1]=INT_MAX;
	for (int i=1; i<=n; ++i)
	if (max(i)<=damage) ++cf[mp[0]];
	else{
		for (vector<p>::iterator j=g(i).begin(); j!=g(i).end(); ++j)
		if (re(i)&&j->second<=damage){
			++cf[mp[j->first]];
			int limit=0,t=(damage-j->second)/re(i)+1+j->first;
			if (++j==g(i).end()) limit=INT_MAX; else limit=j->first; --j;
			if (t<limit) --cf[mp[t]]; else --cf[mp[limit]];
		}
	}
//	for (int i=1; i<=sz; i++) printf("%d %d\n",cf[i],f[i]);
	for (int i=1; i<=sz; ++i) cf[i]+=cf[i-1],gg.push_back(make_pair(cf[i],f[i+1]-1));
	sort(gg.begin(),gg.end(),cmp);
	if (gg[0].second==INT_MAX-1&&increase>0&&gg[0].first>0) puts("-1");
	else printf("%lld\n",1ll*gg[0].first*(1ll*increase*gg[0].second+bounty));
}


//#pragma GCC optimize("O3")
//#pragma GCC target("sse4.1")
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define ford(i, n) for (int i = ((int)(n) - 1); i >= 0; --i)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef pair<int, int> pii;
typedef vector<pii> vii;
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()

ll solve (int n)
{
    int m;
    cin >> m;

    int bnt, dmg, incr;
    cin >> bnt >> incr >> dmg;

    vi start(n), regen(n);
    bool ok = false;

    forn (i, n)
    {
        int mx;
        cin >> mx >> start[i] >> regen[i];
        ok |= (mx <= dmg);
    }

    vector<vii> changes(n);
    forn (i, n)
        changes[i].pb(mp(0, start[i]));

    forn (i, m)
    {
        int tm, en, hp;
        cin >> tm >> en >> hp;
        --en;
        changes[en].pb(mp(tm, hp));
    }
    forn (i, n)
        sort(all(changes[i]));

    if (ok)
        return -1;

    vii evs;
    forn (i, n)
    {
        const auto &e = changes[i];
        forn (j, sz(e))
        {
            int tm, hp;
            tie(tm, hp) = e[j];
            int l = tm;
            int r = (hp > dmg ? l : (regen[i] ? l + (dmg - hp) / regen[i] + 1 : (int)2e9));
            if (j + 1 < sz(e))
                r = min((ll)r, (ll)e[j + 1].fst);

            evs.pb(mp(l, +1));
            evs.pb(mp(r, -1));
        }
    }

    sort(all(evs));

    int cnt = 0;
    ll ans = 0;

    for (int i = 0; i < sz(evs); )
    {
        int j = i;
        while (j < sz(evs) && evs[j].fst == evs[i].fst)
            cnt += evs[j++].snd;

        assert(j == sz(evs) || evs[j].fst > evs[i].fst);
        if (j == sz(evs))
            assert(cnt == 0);
        else
        {
            const ll tmr = evs[j].fst - 1;
            ans = max(ans, (ll)cnt * ((ll)bnt + (ll)tmr * incr));
        }

        i = j;
    }

    return ans;
}

int32_t main()
{
#ifdef LOCAL
    freopen("input.txt", "rt", stdin);
    freopen("output.txt", "w", stdout);
#endif // ONLINE_JUDGE

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    ll n;
    while (cin >> n)
        cout << solve(n) << endl;
}


//#pragma GCC optimize("O3")
//#pragma GCC target("sse4.1")
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define ford(i, n) for (int i = ((int)(n) - 1); i >= 0; --i)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef pair<int, int> pii;
typedef vector<pii> vii;
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()

ll solve (int n)
{
    int m;
    cin >> m;

    int bnt, dmg, incr;
    cin >> bnt >> incr >> dmg;

    vi start(n), regen(n);
    bool ok = false;

    forn (i, n)
    {
        int mx;
        cin >> mx >> start[i] >> regen[i];
        ok |= (mx <= dmg);
    }

    vector<vii> changes(n);
    forn (i, n)
        changes[i].pb(mp(0, start[i]));

    forn (i, m)
    {
        int tm, en, hp;
        cin >> tm >> en >> hp;
        --en;
        changes[en].pb(mp(tm, hp));
    }
    forn (i, n)
        sort(all(changes[i]));

    if (ok)
        return -1;

    vii evs;
    forn (i, n)
    {
        const auto &e = changes[i];
        forn (j, sz(e))
        {
            int tm, hp;
            tie(tm, hp) = e[j];
            int l = tm;
            int r = (hp > dmg ? l : l + (dmg - hp) / regen[i] + 1);
            if (j + 1 < sz(e))
                r = min((ll)r, (ll)e[j + 1].fst);

            evs.pb(mp(l, +1));
            evs.pb(mp(r, -1));
        }
    }

    sort(all(evs));

    int cnt = 0;
    ll ans = 0;

    for (int i = 0; i < sz(evs); )
    {
        int j = i;
        while (j < sz(evs) && evs[j].fst == evs[i].fst)
            cnt += evs[j++].snd;

        assert(j == sz(evs) || evs[j].fst > evs[i].fst);
        if (j == sz(evs))
            assert(cnt == 0);
        else
        {
            const ll tmr = evs[j].fst - 1;
            ans = max(ans, (ll)cnt * ((ll)bnt + (ll)tmr * incr));
        }

        i = j;
    }

    return ans;
}

int32_t main()
{
#ifdef LOCAL
    freopen("input.txt", "rt", stdin);
    freopen("output.txt", "w", stdout);
#endif // ONLINE_JUDGE

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    ll n;
    while (cin >> n)
        cout << solve(n) << endl;
}


//#pragma GCC optimize("O3")
//#pragma GCC target("sse4.1")
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define ford(i, n) for (int i = ((int)(n) - 1); i >= 0; --i)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef pair<int, int> pii;
typedef vector<pii> vii;
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()

ll solve (int n)
{
    int m;
    cin >> m;

    int bnt, dmg, incr;
    cin >> bnt >> incr >> dmg;

    vi start(n), regen(n);
    bool ok = false;

    forn (i, n)
    {
        int mx;
        cin >> mx >> start[i] >> regen[i];
        ok |= (mx <= dmg);
    }

    vector<vii> changes(n);
    forn (i, n)
        changes[i].pb(mp(0, start[i]));

    forn (i, m)
    {
        int tm, en, hp;
        cin >> tm >> en >> hp;
        --en;
        changes[en].pb(mp(tm, hp));
    }
    forn (i, n)
        sort(all(changes[i]));

    if (ok && incr > 0)
        return -1;

    vii evs;
    forn (i, n)
    {
        const auto &e = changes[i];
        forn (j, sz(e))
        {
            int tm, hp;
            tie(tm, hp) = e[j];
            int l = tm;
            int r = (hp > dmg ? l : (regen[i] ? l + (dmg - hp) / regen[i] + 1 : (int)2e9));
            if (j + 1 < sz(e))
                r = min((ll)r, (ll)e[j + 1].fst);

            evs.pb(mp(l, +1));
            evs.pb(mp(r, -1));
        }
    }

    sort(all(evs));

    int cnt = 0;
    ll ans = 0;

    for (int i = 0; i < sz(evs); )
    {
        int j = i;
        while (j < sz(evs) && evs[j].fst == evs[i].fst)
            cnt += evs[j++].snd;

        assert(j == sz(evs) || evs[j].fst > evs[i].fst);
        if (j == sz(evs))
            assert(cnt == 0);
        else
        {
            const ll tmr = evs[j].fst - 1;
            ans = max(ans, (ll)cnt * ((ll)bnt + (ll)tmr * incr));
        }

        i = j;
    }

    return ans;
}

int32_t main()
{
#ifdef LOCAL
    freopen("input.txt", "rt", stdin);
    freopen("output.txt", "w", stdout);
#endif // ONLINE_JUDGE

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    ll n;
    while (cin >> n)
        cout << solve(n) << endl;
}


//#pragma GCC optimize("O3")
//#pragma GCC target("sse4.1")
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define ford(i, n) for (int i = ((int)(n) - 1); i >= 0; --i)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef pair<int, int> pii;
typedef vector<pii> vii;
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()

ll solve (int n)
{
    int m;
    cin >> m;

    int bnt, dmg, incr;
    cin >> bnt >> incr >> dmg;

    vi start(n), regen(n);
    bool ok = false;

    forn (i, n)
    {
        int mx;
        cin >> mx >> start[i] >> regen[i];
        ok |= (mx <= dmg);
    }

    vector<vii> changes(n);
    forn (i, m)
    {
        int tm, en, hp;
        cin >> tm >> en >> hp;
        --en;
        changes[en].pb(mp(tm, hp));
    }
    forn (i, n)
        sort(all(changes[i]));

    if (ok)
        return -1;

    vii evs;
    forn (i, n)
    {
        const auto &e = changes[i];
        forn (j, sz(e))
        {
            int tm, hp;
            tie(tm, hp) = e[j];
            int l = tm;
            int r = (hp > dmg ? l : l + (dmg - hp) / regen[i] + 1);
            if (j + 1 < sz(e))
                r = min(r, e[j + 1].fst);

            evs.pb(mp(l, +1));
            evs.pb(mp(r, -1));
        }
    }

    sort(all(evs));

    int cnt = 0;
    ll ans = 0;

    for (int i = 0; i < sz(evs); )
    {
        int j = i;
        while (j < sz(evs) && evs[j].fst == evs[i].fst)
            cnt += evs[j++].snd;

        assert(j == sz(evs) || evs[j].fst > evs[i].fst);
        if (j == sz(evs))
            assert(cnt == 0);
        else
        {
            const ll tmr = evs[j].fst - 1;
            ans = max(ans, (ll)cnt * ((ll)bnt + (ll)tmr * incr));
        }

        i = j;
    }

    return ans;
}

int main()
{
#ifdef LOCAL
    freopen("input.txt", "rt", stdin);
    freopen("output.txt", "w", stdout);
#endif // ONLINE_JUDGE

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    ll n;
    while (cin >> n)
        cout << solve(n) << endl;
}


//#pragma GCC optimize("O3")
//#pragma GCC target("sse4.1")
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define ford(i, n) for (int i = ((int)(n) - 1); i >= 0; --i)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef pair<int, int> pii;
typedef vector<pii> vii;
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()

ll solve (int n)
{
    int m;
    cin >> m;

    int bnt, dmg, incr;
    cin >> bnt >> incr >> dmg;

    vi start(n), regen(n);
    bool ok = false;

    forn (i, n)
    {
        int mx;
        cin >> mx >> start[i] >> regen[i];
        ok |= (mx <= dmg);
    }

    vector<vii> changes(n);
    forn (i, m)
    {
        int tm, en, hp;
        cin >> tm >> en >> hp;
        --en;
        changes[en].pb(mp(tm, hp));
    }
    forn (i, n)
        sort(all(changes[i]));

    if (ok)
        return -1;

    vii evs;
    forn (i, n)
    {
        const auto &e = changes[i];
        forn (j, sz(e))
        {
            int tm, hp;
            tie(tm, hp) = e[j];
            int l = tm;
            int r = (hp > dmg ? l : l + (dmg - hp) / regen[i] + 1);
            if (j + 1 < sz(e))
                r = min((ll)r, (ll)e[j + 1].fst);

            evs.pb(mp(l, +1));
            evs.pb(mp(r, -1));
        }
    }

    sort(all(evs));

    int cnt = 0;
    ll ans = 0;

    for (int i = 0; i < sz(evs); )
    {
        int j = i;
        while (j < sz(evs) && evs[j].fst == evs[i].fst)
            cnt += evs[j++].snd;

        assert(j == sz(evs) || evs[j].fst > evs[i].fst);
        if (j == sz(evs))
            assert(cnt == 0);
        else
        {
            const ll tmr = evs[j].fst - 1;
            ans = max(ans, (ll)cnt * ((ll)bnt + (ll)tmr * incr));
        }

        i = j;
    }

    return ans;
}

int32_t main()
{
#ifdef LOCAL
    freopen("input.txt", "rt", stdin);
    freopen("output.txt", "w", stdout);
#endif // ONLINE_JUDGE

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    ll n;
    while (cin >> n)
        cout << solve(n) << endl;
}


//#pragma GCC optimize("O3")
//#pragma GCC target("sse4.1")
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define ford(i, n) for (int i = ((int)(n) - 1); i >= 0; --i)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef pair<int, int> pii;
typedef vector<pii> vii;
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()

ll solve (int n)
{
    int m;
    cin >> m;

    int bnt, dmg, incr;
    cin >> bnt >> incr >> dmg;

    vi start(n), regen(n);
    bool ok = false;

    forn (i, n)
    {
        int mx;
        cin >> mx >> start[i] >> regen[i];
        ok |= (mx <= dmg);
    }

    vector<vii> changes(n);
    forn (i, n)
        changes[i].pb(mp(0, start[i]));

    forn (i, m)
    {
        int tm, en, hp;
        cin >> tm >> en >> hp;
        --en;
        changes[en].pb(mp(tm, hp));
    }
    forn (i, n)
        sort(all(changes[i]));

    if (ok)
        return -1;

    vii evs;
    forn (i, n)
    {
        const auto &e = changes[i];
        forn (j, sz(e))
        {
            int tm, hp;
            tie(tm, hp) = e[j];
            int l = tm;
            int r = (hp > dmg ? l : (regen[i] ? l + (dmg - hp) / regen[i] + 1 : (int)2e9));
            if (j + 1 < sz(e))
                r = min((ll)r, (ll)e[j + 1].fst);

            evs.pb(mp(l, +1));
            evs.pb(mp(r, -1));
        }
    }

    sort(all(evs));

    int cnt = 0;
    ll ans = 0;

    for (int i = 0; i < sz(evs); )
    {
        int j = i;
        while (j < sz(evs) && evs[j].fst == evs[i].fst)
            cnt += evs[j++].snd;

        assert(j == sz(evs) || evs[j].fst > evs[i].fst);
        if (j == sz(evs))
            assert(cnt == 0);
        else
        {
            const ll tmr = evs[j].fst - 1;
            ans = max(ans, (ll)cnt * ((ll)bnt + (ll)tmr * incr));
        }

        i = j;
    }

    return ans;
}

int32_t main()
{
#ifdef LOCAL
    freopen("input.txt", "rt", stdin);
    freopen("output.txt", "w", stdout);
#endif // ONLINE_JUDGE

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    ll n;
    while (cin >> n)
        cout << solve(n) << endl;
}


//#pragma GCC optimize("O3")
//#pragma GCC target("sse4.1")
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define ford(i, n) for (int i = ((int)(n) - 1); i >= 0; --i)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef pair<int, int> pii;
typedef vector<pii> vii;
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()

ll solve (int n)
{
    int m;
    cin >> m;

    int bnt, dmg, incr;
    cin >> bnt >> incr >> dmg;

    vi start(n), regen(n);
    bool ok = false;

    forn (i, n)
    {
        int mx;
        cin >> mx >> start[i] >> regen[i];
        ok |= (mx <= dmg);
    }

    vector<vii> changes(n);
    forn (i, n)
        changes[i].pb(mp(0, start[i]));

    forn (i, m)
    {
        int tm, en, hp;
        cin >> tm >> en >> hp;
        --en;
        changes[en].pb(mp(tm, hp));
    }
    forn (i, n)
        sort(all(changes[i]));

    forn (i, n)
    if (!regen[i] && changes[i].back().snd <= dmg)
        ok = true;

    if (ok && incr > 0)
        return -1;

    vii evs;
    forn (i, n)
    {
        const auto &e = changes[i];
        forn (j, sz(e))
        {
            int tm, hp;
            tie(tm, hp) = e[j];
            int l = tm;
            int r = (hp > dmg ? l : (regen[i] ? l + (dmg - hp) / regen[i] + 1 : (int)2e9));
            if (j + 1 < sz(e))
                r = min((ll)r, (ll)e[j + 1].fst);

            evs.pb(mp(l, +1));
            evs.pb(mp(r, -1));
        }
    }

    sort(all(evs));

    int cnt = 0;
    ll ans = 0;

    for (int i = 0; i < sz(evs); )
    {
        int j = i;
        while (j < sz(evs) && evs[j].fst == evs[i].fst)
            cnt += evs[j++].snd;

        assert(j == sz(evs) || evs[j].fst > evs[i].fst);
        if (j == sz(evs))
            assert(cnt == 0);
        else
        {
            const ll tmr = evs[j].fst - 1;
            ans = max(ans, (ll)cnt * ((ll)bnt + (ll)tmr * incr));
        }

        i = j;
    }

    return ans;
}

int32_t main()
{
#ifdef LOCAL
    freopen("input.txt", "rt", stdin);
    freopen("output.txt", "w", stdout);
#endif // ONLINE_JUDGE

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    ll n;
    while (cin >> n)
        cout << solve(n) << endl;
}


//#pragma GCC optimize("O3")
//#pragma GCC target("sse4.1")
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define ford(i, n) for (int i = ((int)(n) - 1); i >= 0; --i)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef pair<int, int> pii;
typedef vector<pii> vii;
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()

#define int long long
ll solve (int n)
{
    int m;
    cin >> m;

    int bnt, dmg, incr;
    cin >> bnt >> incr >> dmg;

    vi start(n), regen(n);
    bool ok = false;

    forn (i, n)
    {
        int mx;
        cin >> mx >> start[i] >> regen[i];
        ok |= (mx <= dmg);
    }

    vector<vii> changes(n);
    forn (i, m)
    {
        int tm, en, hp;
        cin >> tm >> en >> hp;
        --en;
        changes[en].pb(mp(tm, hp));
    }
    forn (i, n)
        sort(all(changes[i]));

    if (ok)
        return -1;

    vii evs;
    forn (i, n)
    {
        const auto &e = changes[i];
        forn (j, sz(e))
        {
            int tm, hp;
            tie(tm, hp) = e[j];
            int l = tm;
            int r = (hp > dmg ? l : l + (dmg - hp) / regen[i] + 1);
            if (j + 1 < sz(e))
                r = min((ll)r, (ll)e[j + 1].fst);

            evs.pb(mp(l, +1));
            evs.pb(mp(r, -1));
        }
    }

    sort(all(evs));

    int cnt = 0;
    ll ans = 0;

    for (int i = 0; i < sz(evs); )
    {
        int j = i;
        while (j < sz(evs) && evs[j].fst == evs[i].fst)
            cnt += evs[j++].snd;

        assert(j == sz(evs) || evs[j].fst > evs[i].fst);
        if (j == sz(evs))
            assert(cnt == 0);
        else
        {
            const ll tmr = evs[j].fst - 1;
            ans = max(ans, (ll)cnt * ((ll)bnt + (ll)tmr * incr));
        }

        i = j;
    }

    return ans;
}

int32_t main()
{
#ifdef LOCAL
    freopen("input.txt", "rt", stdin);
    freopen("output.txt", "w", stdout);
#endif // ONLINE_JUDGE

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    ll n;
    while (cin >> n)
        cout << solve(n) << endl;
}


#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <bitset>
#include <queue>
#include <stack>
#include <sstream>
#include <cstring>
#include <numeric>
#include <ctime>
#include <cassert>

#define re return
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int) (x).size())
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; i--)
#define y0 y32479
#define y1 y95874
#define fill(x, y) memset(x, y, sizeof(x))
#define sqr(x) ((x) * (x))
#define sqrt(x) sqrt(abs(x))
#define unq(x) (x.resize(unique(all(x)) - x.begin()))
#define spc(i,n) " \n"[i == n - 1]
#define next next239
#define prev prev239

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
typedef double D;
typedef long double LD;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;

template<class T> T abs(T x) { return x > 0 ? x : -x;}

const ll mod = 1000000000 + 7;

int m;
int n;
ll ans;

int nint() {
	int x;
	scanf("%d", &x);
	re x;
}

ll maxhp[100500];
ll lasttime[100500];
ll lasthp[100500];
ll regen[100500];
ll bounty, inc;
ll damage;
ll curt;

ll getHp(int i) {
	re min(maxhp[i], lasthp[i] + regen[i] * (curt - lasttime[i]));
}

ll getTime(int i) {
	ll d = damage + 1 - getHp(i);
	ll ans = curt + (d + regen[i]) / regen[i];
	re ans;
}

bool f(int a, int b) {
	ll t1 = getTime(a);
	ll t2 = getTime(b);
	if (t1 != t2)
		re t1 < t2;
	re a < b;
}

set<int, bool (*) (int, int)> s1(f);
set<int> s2;

void check() {
	//cout << "check: " << curt << endl;
	ans = max(ans, (bounty + curt * inc) * sz(s1));
}

void setHp(int i, ll hp, bool opa = false) {
	if (!opa) {
		if (s2.count(i))
			s2.erase(i);
		else
			s1.erase(i);
	}

	lasthp[i] = hp;
	lasttime[i] = curt;
	if (hp <= damage) {
		if (regen[i] == 0) {
			cout << -1;
			exit(0);
		}
		s1.insert(i);
	}
	else
		s2.insert(i);
}

void updateS1() {
	int x = *s1.begin();
	ll tt = getTime(x);
	vi v;
	for (int o : s1) {
		if (getTime(o) != tt)
			break;
		v.pb(o);
	}
	curt = tt - 1;
	check();
	for (int x : v) {
		s1.erase(x);
		s2.insert(x);
	}
	curt = tt;
}

void tryUpdate(ll nt) {
	while (sz(s1)) {
		int x = *s1.begin();
		ll tt = getTime(x);
		if (tt <= nt)
			updateS1();
		else
			break;
	}
	curt = nt;
}

int main() {
#ifdef LOCAL_BOBER
	freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
#else
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
#endif

	cin >> n >> m;
	cin >> bounty >> inc >> damage;
	rep(i, n) {
		maxhp[i] = nint();
		lasthp[i] = nint();
		regen[i] = nint();
		if (damage >= maxhp[i]) {
			cout << -1;
			re 0;
		}
		setHp(i, lasthp[i], true);
	}
	check();

	vector<pair<int, ii> > q;
	rep(i, m) {
		pair<int, ii> x;
		x.fi = nint();
		x.se.fi = nint();
		x.se.se = nint();
		q.pb(x);
	}

	sort(all(q));
	for (auto o : q) {
		int tt = o.fi;
		int id = o.se.fi - 1;
		int hp = o.se.se;
		if (curt < tt)
			tryUpdate(tt);
		setHp(id, hp);
	}
	tryUpdate(2 * mod);

	cout << ans;
}


#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <bitset>
#include <queue>
#include <stack>
#include <sstream>
#include <cstring>
#include <numeric>
#include <ctime>
#include <cassert>

#define re return
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int) (x).size())
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; i--)
#define y0 y32479
#define y1 y95874
#define fill(x, y) memset(x, y, sizeof(x))
#define sqr(x) ((x) * (x))
#define sqrt(x) sqrt(abs(x))
#define unq(x) (x.resize(unique(all(x)) - x.begin()))
#define spc(i,n) " \n"[i == n - 1]
#define next next239
#define prev prev239

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
typedef double D;
typedef long double LD;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;

template<class T> T abs(T x) { return x > 0 ? x : -x;}

const ll mod = 1000000000 + 7;

int m;
int n;
ll ans;

int nint() {
	int x;
	scanf("%d", &x);
	re x;
}

ll maxhp[100500];
ll lasttime[100500];
ll lasthp[100500];
ll regen[100500];
ll bounty, inc;
ll damage;
ll curt;

ll getHp(int i) {
	re min(maxhp[i], lasthp[i] + regen[i] * (curt - lasttime[i]));
}

ll getTime(int i) {
	if (regen[i] == 0)
		re 2 * mod + 1;
	ll d = damage + 1 - getHp(i);
	ll ans = curt + (d + regen[i] - 1) / regen[i];
	re ans;
}

bool f(int a, int b) {
	ll t1 = getTime(a);
	ll t2 = getTime(b);
	if (t1 != t2)
		re t1 < t2;
	re a < b;
}

set<int, bool (*) (int, int)> s1(f);
set<int> s2;

void check() {
	//cout << "check: " << curt << endl;
	ans = max(ans, (bounty + curt * inc) * sz(s1));
}

void setHp(int i, ll hp, bool opa = false) {
	if (!opa) {
		if (s2.count(i))
			s2.erase(i);
		else
			s1.erase(i);
	}

	lasthp[i] = hp;
	lasttime[i] = curt;
	if (hp <= damage) {
		if (regen[i] == 0 && inc) {
			cout << -1;
			exit(0);
		}
		s1.insert(i);
	}
	else
		s2.insert(i);
}

void updateS1() {
	int x = *s1.begin();
	ll tt = getTime(x);
	vi v;
	for (int o : s1) {
		if (getTime(o) != tt)
			break;
		v.pb(o);
	}
	curt = tt - 1;
	check();
	for (int x : v) {
		s1.erase(x);
		s2.insert(x);
	}
	curt = tt;
}

void tryUpdate(ll nt) {
	while (sz(s1)) {
		int x = *s1.begin();
		ll tt = getTime(x);
		if (tt <= nt)
			updateS1();
		else
			break;
	}
	if (curt < nt) {
		curt = nt - 1;
		check();
	}
	curt = nt;
}

int main() {
#ifdef LOCAL_BOBER
	freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
#else
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
#endif

	cin >> n >> m;
	cin >> bounty >> inc >> damage;
	rep(i, n) {
		maxhp[i] = nint();
		lasthp[i] = nint();
		regen[i] = nint();
		if (damage >= maxhp[i] && inc) {
			cout << -1;
			re 0;
		}
		setHp(i, lasthp[i], true);
	}
	check();

	vector<pair<int, ii> > q;
	rep(i, m) {
		pair<int, ii> x;
		x.fi = nint();
		x.se.fi = nint();
		x.se.se = nint();
		q.pb(x);
	}

	sort(all(q));
	for (auto o : q) {
		int tt = o.fi;
		int id = o.se.fi - 1;
		int hp = o.se.se;
		if (curt < tt)
			tryUpdate(tt);
		setHp(id, hp);
	}
	tryUpdate(2 * mod);

	cout << ans;
}