题号：NC207986
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
题目描述
Xiaoming is playing a game with his father. There are n(1<n<1e9) Caasiu(a kind of food), two people take turns to eat from some of them, at least 1, a maximum of m(0<m<1e9), each of them chooses the best strategy. The one who eats the last Caasiu wins, Xiaoming's father first. If Xiaoming wins, Xiaoming's father will say"You are a clever boy!", else he will say "Keep on fighting!".
输入描述:
There are integers: n, m.
输出描述:
output 1 lines, the result of Xiaoming's father said.