#include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) {
  if (!a) return b;
  return GCD(b % a, a);
}
vector<int> x(4000);
vector<int> y(4000);
void D(double x, double y, double x1, double y1) {
  double d = (x - x1) * (x - x1) + (y - y1) * (y - y1);
  cout << sqrt(d) << "\n";
}
int main() {
  int n, k;
  cin >> n >> k;
  int tot = ((n - 1) * n) / 2;
  if (tot > k) {
    y[0] = 0;
    for (int i = 1; i < n; i++) {
      y[i] = y[i - 1] + (100000 - i);
    }
    for (int i = 0; i < n; i++) {
      printf("%d %d\n", i, y[i]);
    }
  } else {
    puts("no solution");
  }
  return 0;
}
