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