Problem: Convexity of a set of points on the plane is the size of the largest subset of points that form a convex polygon. Your task is to build a set of n points with the convexity of exactly m. Your set of points should not contain three points that lie on a straight line.

Input

The single line contains two integers n and m (3 ≤ m ≤ 100, m ≤ n ≤ 2m).

Output

If there is no solution, print "-1". Otherwise, print n pairs of integers — the coordinates of points of any set with the convexity of m. The coordinates shouldn't exceed 108 in their absolute value.

Examples

Input

4 3


Output

0 0
3 0
0 3
1 1


Input

6 3


Output

-1


Input

6 6


Output

10 0
-10 0
10 1
9 1
9 -1
0 -2


Input

7 4


Output

176166 6377
709276 539564
654734 174109
910147 434207
790497 366519
606663 21061
859328 886001

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 100000000;
int main() {
  int n, m, d, y, i, j, g;
  cin >> n >> m;
  if (m == 3) {
    if (n >= 5) {
      cout << -1;
      return 0;
    }
    cout << "0 0\n3 0\n0 3\n";
    if (n == 4) cout << "1 1\n";
    return 0;
  }
  cout << "0 0\n";
  cout << m - 1 << " " << 0 << endl;
  y = 0;
  d = 100;
  for (i = 1; i <= m - 2; i++) {
    y += d;
    d--;
    cout << i << " " << y << endl;
  }
  g = n - m;
  if (g == 0) return 0;
  cout << "0 " << N << endl;
  if (g == 1) return 0;
  cout << m - 1 << " " << N << endl;
  ;
  y = N;
  d = 100;
  for (i = 1; i <= g - 2; i++) {
    y -= d;
    d--;
    cout << m - 1 - i << " " << y << endl;
  }
  return 0;
}