#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const double eps = 1e-8;
const int nm = 300005;
int n, k, m, t;
long long res;
int a[nm];
bool check[nm];
long long Pow(int x, int mu) {
  if (mu == 0) return 1ll;
  long long res = Pow(x, mu >> 1);
  res = res * res % MOD;
  if (mu & 1) res = res * x % MOD;
  return res;
}
int main() {
  int i, j, x, y, z, w;
  cin >> n >> k;
  if (n * (n - 1) / 2 <= k) {
    cout << "no solution";
    return 0;
  }
  printf("0 0\n");
  for (i = n; i > 1; i--) {
    t += i;
    printf("0 %d\n", t);
  }
  return 0;
}
