#include <bits/stdc++.h>
using namespace std;
struct node {
  int x, y;
} ans[2010];
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  int tot = (n) * (n - 1) / 2;
  if (tot <= k)
    printf("no solution\n");
  else {
    for (int i = 0; i < n; i++) {
      printf("0 %d\n", i);
    }
  }
  return 0;
}
