#include <bits/stdc++.h>
using namespace std;
const int inf = 1000000000;
const int MOD = 1000000007;
const double pi = acos(-1.0);
int main() {
  int n, k;
  cin >> n >> k;
  if (k >= n * (n - 1) / 2)
    cout << "no solution" << endl;
  else {
    for (int i = (1); i <= (n); ++i) cout << "0 " << i << endl;
  }
}
