#include <bits/stdc++.h>
const int N = 10005;
int x[N], y[N];
int main() {
  int n, i, k;
  scanf("%d%d", &n, &k);
  if (k >= n * (n - 1) / 2) {
    puts("no solution");
    return 0;
  }
  for (i = 0; i < n; i++) {
    x[i] = 0;
    y[i] = i;
  }
  for (i = 0; i < n; i++) printf("%d %d\n", x[i], y[i]);
  return 0;
}
