#include <bits/stdc++.h>
int main() {
  int tot, n, k, i, j;
  while (scanf("%d%d", &n, &k) == 2) {
    tot = (n * (n - 1)) / 2;
    if (tot <= k)
      printf("no solution\n");
    else {
      j = 1;
      for (i = 0; i < n; i++) {
        j = j + i;
        printf("0 %d\n", j);
      }
    }
  }
  return 0;
}
