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