Problem: Roland loves growing flowers. He has recently grown a beautiful rose at point (0, 0) of the Cartesian coordinate system. The rose is so beautiful that Roland is afraid that the evil forces can try and steal it. 

To protect the rose, Roland wants to build n watch towers. Let's assume that a tower is a point on the plane at the distance of at most r from the rose. Besides, Roland assumes that the towers should be built at points with integer coordinates and the sum of squares of distances between all pairs of towers must be as large as possible. Note, that Roland may build several towers at the same point, also he may build some of them at point (0, 0).

Help Roland build the towers at the integer points so that the sum of squares of distances between all towers is maximum possible. Note that the distance in this problem is defined as the Euclidian distance between points.

Input

The first line contains two integers, n and r (2 ≤ n ≤ 8; 1 ≤ r ≤ 30).

Output

In the first line print an integer — the maximum possible sum of squared distances. In the i-th of the following n lines print two integers, xi, yi — the coordinates of the i-th tower. Each tower must be inside or on the border of the circle with radius r. Note that there may be several towers located at the same point of the plane, also some towers can be located at point (0, 0).

If there are multiple valid optimal arrangements, choose any of them.

Examples

Input

4 1


Output

16
0 1
0 1
0 -1
0 -1


Input

3 6


Output

312
0 6
5 -3
-5 -3

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
const long long INF = 0x3f3f3f3f3f3f3f3f;
const int inf = 0x3f3f3f3f;
using namespace std;
int t, n, r;
int ans[100];
int nb;
int tot;
struct node {
  int x, y;
} q[10000];
int id[1000];
int limit;
int endans;
bool cmp(node a, node b) {
  return a.x * a.x + a.y * a.y > b.x * b.x + b.y * b.y;
}
int juli(int a, int b) {
  return (q[a].x - q[b].x) * (q[a].x - q[b].x) +
         (q[a].y - q[b].y) * (q[a].y - q[b].y);
}
void dfs(int now, int cnt, int val) {
  if (now == n + 1) {
    if (nb >= val) {
      return;
    }
    for (int i = 1; i < now; i++) {
      ans[i] = id[i];
    }
    nb = val;
    return;
  }
  for (int i = cnt; i <= limit; i++) {
    int temp = val;
    id[now] = i;
    for (int j = 1; j < now; j++) {
      temp += juli(i, id[j]);
    }
    dfs(now + 1, i, temp);
  }
}
int main() {
  scanf("%d%d", &n, &r);
  int num = 0;
  for (int i = n; i <= n; i++) {
    for (int j = r; j <= r; j++) {
      nb = 0;
      tot = 0;
      for (int xx = -j; xx <= j; xx++) {
        for (int yy = -j; yy <= j; yy++) {
          if (xx * xx + yy * yy <= j * j) {
            q[++tot].x = xx;
            q[tot].y = yy;
          }
        }
      }
      sort(q + 1, q + 1 + tot, cmp);
      if (i <= 3)
        limit = min(tot, 32);
      else
        limit = min(tot, 21);
      n = i;
      dfs(1, 1, 0);
      endans = nb;
    }
  }
  printf("%d\n", endans);
  for (int i = 1; i <= n; i++) {
    printf("%d %d\n", q[ans[i]].x, q[ans[i]].y);
  }
  return 0;
}