Planting Tree#3792
Novel-Supertv Digital TV Technology Co., Ltd is one of the leading digital TV technology solution providers in China. Novel-Supertv offers customized solutions for cable, satellite, terrestrial, IPTV, and handset TV networks. We often hold some competitions, games and other activities, like playing ping pong ball, basket ball, climbing mountains, live battle CS and so on. Last year we organized a planting tree activity, a colleague thought of a very interesting question. The question is:
There are (N \geq 2) trees, you can plant them into several lines. If a line has and only has (2 \leq M \leq N) trees, we called it " trees line". We want to find the maximum number of " trees line" that can be planted with the trees. Now, can you make a program and tell us the answer?
For example:
The input contains several lines. Each line contains two integers and separated by several blank characters (2 \leq N \leq 10, 2 \leq M \leq N).
For each input line, you should output a line contains the maximum number of " trees line" that can be planted.
Example 1