#include <bits/stdc++.h>
using namespace std;
int n, k;
int main() {
  scanf("%d %d", &n, &k);
  int limit = (n * (n - 1)) / 2;
  if (k >= limit) {
    puts("no solution");
    return 0;
  }
  int x, y, xdif, ydif;
  x = y = 0;
  xdif = 1;
  ydif = n;
  for (int i = 0; i < n; i++) {
    printf("%d %d\n", x, y);
    x += xdif;
    y += ydif;
  }
  return 0;
}
