#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long INFLL = 0x3f3f3f3f3f3f3f3fLL;
inline long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
const int maxn = 1e5 + 10;
int n, r, cnt, ans;
int ax[maxn], ay[maxn], tx[maxn], ty[maxn];
struct node {
  int x, y, dis;
  bool operator<(const node& rhs) const { return dis > rhs.dis; }
} point[900];
void dfs(int t, int p) {
  if (p == n) {
    int u = 0;
    for (int i = 0; i < p; i++)
      for (int j = i + 1; j < p; j++)
        u += (tx[i] - tx[j]) * (tx[i] - tx[j]) +
             (ty[i] - ty[j]) * (ty[i] - ty[j]);
    if (u > ans) {
      ans = u;
      for (int i = 0; i < p; i++) ax[i] = tx[i], ay[i] = ty[i];
    }
    return;
  }
  for (int i = t; i < cnt; i++) {
    tx[p] = point[i].x, ty[p] = point[i].y;
    dfs(i, p + 1);
  }
}
int main() {
  cin >> n >> r;
  for (int i = -r; i <= r; i++)
    for (int j = -r; j <= r; j++) {
      int t = i * i + j * j;
      if (t <= r * r) point[cnt].x = i, point[cnt].y = j, point[cnt++].dis = t;
    }
  sort(point, point + cnt);
  cnt = 18;
  dfs(0, 0);
  cout << ans << endl;
  for (int i = 0; i < n; i++) cout << ax[i] << " " << ay[i] << endl;
  return 0;
}
