zoj 1229 Gift

#include<iostream>
#include<string>
#include<cstring>
#include<vector>
#include<map>
#include<algorithm>
#include<stdio.h>
#include<stdlib.h>
#include<queue>
using namespace std;
int m, n;

bool bfs() {

	if (n >= 50)return true;

	queue<int>q;
	q.push(1);
	int coun = 1;
	int num, sz, i;
	while (!q.empty()) {
		coun += 2;
		sz = q.size();
		for (i = 0; i < sz; i++) {
			num = q.front();
			if (num == m) {
				return true;
			}
			q.pop();


			if (num + coun <= n) {
				q.push(num + coun);
			}

			if (num - coun >= 1) {
				q.push(num - coun);
			}
		}

	}
	return false;
}

int main() {
	while (scanf("%d%d", &n, &m) && n) {
		if (bfs()) {
			printf("Let me try!\n");
		} else {
			printf("Don't make fun of me!\n");
		}
	}
}