1 10 2
1 10 3
1 10 5
40 60 7
1 1000 2
1 1000 10
2 3 2
2 8 7
2 8 10
931 937 4
203 209 5
322 328 6
73 81 8
83 90 6
1 17 9
3 19 10
370 947 8
598 872 5
561 638 4
125 666 4
125 307 8
72 696 4
377 922 7
14 885 6
489 662 7
514 530 3
0 0 0

first 4: sample input
next 2: extrema
next 1: simple no seq
next 2: check for d > n-m
next 4: largest m-n with no seq for each d
next 1: largest number of recursive calls with a solution
next 2: 2 largest number of recursive calls with no solution
next 10: random