#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  scanf("%d", &n);
  scanf("%d", &k);
  int mmax = n * (n - 1) / 2;
  if (k >= mmax) {
    puts("no solution");
    return 0;
  }
  int diff = n;
  int cx = 0, cy = 0;
  for (int i = 0; i < n; i++) {
    printf("%d %d\n", cx, cy);
    cx++;
    cy += (n + 2);
  }
  return 0;
}
