1 #include <iostream>
 2 #include <cstring>
 3 #include <cstdio>
 4 #include <vector>
 5 #include <algorithm>
 6 using namespace std;
 7
 8 struct Node
 9 {
10     double p;
11     int val;
12     Node(){}
13     Node(int v, double _p):val(v), p(_p){}
14 };
15
16 bool comp(const Node &lhs, const Node &rhs)
17 {
18     if (lhs.p > rhs.p)
19         return true;
20     else if (lhs.p < rhs.p)
21         return false;
22     else
23         return lhs.val < rhs.val;
24 }
25
26 int main()
27 {
28     int n, m;
29     int f[10][81];
30     while(cin >> n)
31     {
32         if (n == 0)
33             break;
34         cin >> m;
35         memset(f, 0, sizeof(f));
36
37         for(int i = 1; i <= m; i++)
38             f[0][i] = 1;
39
40         int v = m * n;
41         for(int i = 1; i < n; i++)
42             for(int j = 1; j <= m; j++)
43                 for(int k = 1; k <= v - j; k++)
44                     f[i][k+j] += f[i-1][k];
45
46         vector<Node> num;
47         int sum = 0;
48         for(int i = 1; i <= v; i++)
49             sum += f[n-1][i];
50
51         for(int i = 1; i <= v; i++)
52         {
53             double p = f[n-1][i] / (double)sum;
54             p += 0.005;
55             int a = (int)(p * 100);
56             p = (double)a / 100;
57             num.push_back(Node(i, p));
58         }
59
60         sort(num.begin(), num.end(), comp);
61
62         for(int i = 0; i < 3; i++)
63             printf("%d %.2lf\n", num[i].val, num[i].p);
64         printf("\n");
65     }
66 }