#include <bits/stdc++.h>
using namespace std;
int m2pow(int x) {
  long long ans = 1, p = 2;
  while (x) {
    if (x & 1) ans = (ans * p) % (1000000007);
    p = (p * p) % (1000000007);
    x /= 2;
  }
  return ans;
}
int main() {
  int n, k;
  scanf("%d %d", &n, &k);
  if (n * (n - 1) / 2 <= k) {
    puts("no solution");
    return 0;
  }
  for (int i = 0; i < n; i++) {
    printf("%d %d\n", i, i * (n + 1));
  }
}
