#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  cin >> n >> k;
  int nx = 0, ny = 0;
  if (k >= n * (n - 1) / 2)
    printf("no solution\n");
  else {
    int dst = sqrt(n * (n + 2)) + 1;
    for (int i = 1; i <= n; ++i) {
      printf("%d %d\n", nx, ny);
      nx += 1;
      ny += dst;
    }
  }
  return 0;
}
