#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7;
int n, k;
int main() {
  cin >> n >> k;
  int num = n * (n - 1) / 2;
  if (k >= num) {
    puts("no solution");
    return 0;
  }
  for (int i = 1; i <= n; i++) printf("%d %d\n", 0, i);
  return 0;
}
