#include <bits/stdc++.h>
using namespace std;
void doit() {
  long long n, k, a;
  cin >> n >> k;
  a = ((n - 1) * n) / 2;
  if (a <= k) {
    cout << "no solution" << endl;
    return;
  }
  for (int i = 0; i < n; i++) {
    cout << "0 " << i << endl;
  }
  return;
}
int main() {
  doit();
  return 0;
}
