#include <iostream>#include <cstring>#include <cstdio>#include <queue>#define maxn 10010using namespace std;int n,m,num,head[maxn],du[maxn],tot;queue<int>q;struct node{    int v,pre;}e[maxn*3];void Add(int from,int to){    num++;    e[num].v=to;    e[num].pre=head[from];    head[from]=num;}int main(){    scanf("%d%d",&n,&m);    int x,y;    for(int i=1;i<=m;i++)    {        scanf("%d%d",&x,&y);          Add(x,y);        du[y]++;    }    for(int i=1;i<=n;i++)    {        if(du[i]==0)        {            q.push(i);            tot++;        }    }    while(!q.empty())    {        int k=q.front();        q.pop();          for(int i=head[k];i;i=e[i].pre)          {              int v=e[i].v;                du[v]--;                if(!du[v])                {                    q.push(v);                    tot++;                        }              }    }    if(tot==n) printf("Oh,yeah!");    else if(tot<=n&&tot>=1) printf("pass");    else printf("I‘ll die!");    return 0;}