1. 1
2. 2
3. 3
4. 4
5. 5
6. 6
7. 7
8. 8
9. 9
10. 10
11. 11
12. 12
13. 13
14. 14
15. 15
16. 16
17. 17
18. 18
19. 19
20. 20
21. 21
22. 22
23. 23
24. 24
25. 25
26. 26
27. 27
28. 28
29. 29
30. 30
31. 31
32. 32
33. 33
34. 34
35. 35
36. 36
37. 37
38. 38
39. 39
40. 40
41. 41
42. 42
43. 43
44. 44
45. 45
46. 46
47. 47
48. 48
49. 49
50. 50
51. 51
52. 52
53. 53
54. 54
55. 55
56. 56
57. 57
58. 58
59. 59
60. 60
61. 61
62. 62
63. 63
64. 64
65. 65
66. 66
67. 67
68. 68
69. 69
70. 70
71. 71
72. 72
73. 73
74. 74
75. 75
76. 76
77. 77
78. 78
79. 79
80. 80
81. 81
82. 82
83. 83
84. 84
85. 85
86. 86
87. 87
88. 88
89. 89
90. 90
91. 91
92. 92
93. 93
94. 94
95. 95
96. 96
97. 97
98. 98
99. 99
100. 100
101. 101
102. 102
103. 103
104. 104
105. 105
106. 106
107. 107
108. 108
109. 109
110. 110
111. 111
112. 112
113. 113
114. 114
115. 115
116. 116
117. 117
118. 118
119. 119
120. 120
121. 121
122. 122
123. 123
124. 124
125. 125
126. 126
127. 127
128. 128
129. 129
130. 130
131. 131
132. 132
133. 133
134. 134
135. 135
136. 136
137. 137
138. 138
139. 139
140. 140
141. 141
142. 142
143. 143
144. 144
145. 145
146. 146
147. 147
148. 148
149. 149
150. 150
151. 151
152. 152
153. 153
154. 154
155. 155
156. 156
157. 157
158. 158
159. 159
160. 160
161. 161
162. 162
163. 163
164. 164
165. 165
166. 166
167. 167
168. 168
169. 169
170. 170
171. 171
172. 172
173. 173
174. 174
175. 175
176. 176
177. 177
178. 178
179. 179
180. 180
181. 181
182. 182
183. 183
184. 184
185. 185
186. 186
187. 187
188. 188
189. 189
190. 190
191. 191
192. 192
193. 193
194. 194
195. 195
196. 196

#include <cstdio>
#include <vector>
#include <algorithm>
#include <chrono>
#include <random>
#include <cstring>

using namespace std;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

bool comp[200005];

//#define BOUND 40

int min_f[200005], max_f[200005];

bool use_set[200005];

vector<int> factors[200005];

void find_all(int m, int min_factor, int max_factor, vector<int>& res)
{
    for (int i = 2; i <= m; i++) {
        if (min_f[i] >= min_factor && max_f[i] <= max_factor) {
            res.push_back(i);
        }
    }
}

void find_all(int m, bool inset, vector<int>& res)
{
    for (int i = 1; i <= m; i++) {
        bool good = true;
        for (int j = 0; j < factors[i].size(); j++) {
            if (use_set[factors[i][j]] != inset) {
                good = false; break;
            }
        }
        if (good) res.push_back(i);
    }
}

int solve_bound(int n, int m)
{
    int BOUND;
    if (m == 40000) {
        BOUND = 50;
    } else if (m == 4000) {
        BOUND = 20;
    } else {
        BOUND = 10;
    }
    int maxv;
    if (m == 40000) {
        maxv = 300;
    } else if (m == 4000) {
        maxv = 100;
    } else {
        maxv = 30;
    }
    for (int i = 1; i <= BOUND; i++) use_set[i] = true;
    int prev_score = 0;
    while (true) {
        vector<int> group1, group2;
        for (int i = 1; i <= 6; i++) {
            int x = rng() % maxv + 2;
            while (comp[x]) x = rng() % maxv + 2;
            use_set[x] = !use_set[x];
        }
        find_all(m, true, group1);
        find_all(m, false, group2);
        int new_score = min(group1.size(), group2.size());
        //fprintf(stderr, "%d %d\n", (int)group1.size(), (int)group2.size());
        if (new_score > prev_score) {
            FILE* file = fopen("1_3.out", "w");
            for (int i = 0; i < min(group1.size(), group2.size()); i++) {
                fprintf(file, "%d ", group1[i]);
            }
            fprintf(file, "\n");
            for (int i = 0; i < min(group1.size(), group2.size()); i++) {
                fprintf(file, "%d ", group2[i]);
            }
            prev_score = new_score;
            printf("-- %d --\n", new_score);
        }
    }
}

bool f[10][4005];
int pre[10][4005];

void do_dp(int n, int m, int min_cnt)
{
    for (int i = 0; i <= n; i++) {
        for (int j = 0; j <= m; j++) {
            f[i][j] = false;
        }
    }
    f[0][1] = true;
    for (int i = 1; i <= n; i++) {
        for (int j = 2; j <= m; j++) {
            if (j != m && comp[j + 1]) continue;
            for (int k = 1; k < j; k++) {
                if (comp[k+1]) continue;
                if (!f[i-1][k]) continue;
                vector<int> res; find_all(m, k+1, j, res);
                if (res.size() < min_cnt) continue;
                f[i][j] = true;
                pre[i][j] = k;
                break;
            }
        }
    }
}

int main()
{
    int n, m; scanf("%d%d", &n, &m);
    for (int i = 2; i <= m; i++) {
        min_f[i] = 10000000;
        max_f[i] = 0;
        int cur = i;
        bool good = true;
        for (int j = 2; j * j <= i; j++) {
            while (cur % j == 0) {
                cur /= j;
                max_f[i] = max(max_f[i], j);
                min_f[i] = min(min_f[i], j);
                factors[i].push_back(j);
                good = false;
            }
        }
        if (cur > 1) {
            factors[i].push_back(cur);
            max_f[i] = max(max_f[i], cur);
            min_f[i] = min(min_f[i], cur);
        }
        //if (cur != 1 && (cur < min_factor || cur > max_factor)) good = false;
        //if (good) res.push_back(i);
        printf("%d %d\n", min_f[i], max_f[i]);
    }
    for (int i = 2; i <= 200000; i++) {
       if (comp[i]) continue;
       for (int j = i * 2; j <= 200000; j += i) {
           comp[j] = true;
       }
    }
    if (n == 2) {
        solve_bound(n, m);
    } else {
        int l = 1; int r = m;
        while (l < r) {
            int mid = (l + r) / 2 + 1;
            do_dp(n, m, mid);
            if (f[n][m]) {
                l = mid;
            } else {
                r = mid - 1;
            }
        }
        do_dp(n, m, l);
        vector<int> ans[20];
        int cur = m;
        for (int i = n; i >= 1; i--) {
            find_all(m, pre[i][cur] + 1, cur, ans[i]);
            cur = pre[i][cur];
        }
        for (int i = 1; i <= n; i++) {
            printf("1 ");
            for (int j = 0; j < l; j++) {
                printf("%d ", ans[i][j]);
            }
            printf("\n");
        }
    }
    return 0;
}

/*
vector<int> primes;
int prime_above_cnt = 0;
for (int i = 2; i <= m; i++) {
    if (!comp[i]) {
        primes.push_back(i);
    }
}
printf("%d\n", prime_above_cnt);
int cnt = primes.size() / n;
for (int i = 0; i < n; i++) {
    for (int j = i * cnt; j < (i + 1) * cnt; j++) {
        printf("%d ", primes[j]);
    }
    printf("\n");
}
*/