#include<bits/stdc++.h>

using namespace std;

int a, b, visitados[1000005];

bool bfs(int pulo, int pos){
    queue<pair<int,int> > fila;
    fila.push(make_pair(pulo,pos));
    while(!fila.empty()){
        int p = fila.front().first;
        int v = fila.front().second;
        fila.pop();

        visitados[v] = 1;

        int x = (p * 2) - 1;
        int y = v - x;
        if(y > 0 && !visitados[y]){
            fila.push(make_pair(p+1,y));
        }

        y = v + x;
        if(y <= a && !visitados[y]){
            fila.push(make_pair(p+1,y));
        }

        if(visitados[b]) return true;


    }

    return false;

}
int main(){
    while(scanf("%d%d",&a,&b),a,b){
        memset(visitados, 0, sizeof visitados);
        printf("%s\n",a >= 100 ? "Let me try!" : bfs(1,0) ? "Let me try!" : "Don't make fun of me!");
    }
    return 0;
}