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
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const double eps = 1e-8;
const int nm = 300005;
int n, k, m, t;
long long res;
int a[nm];
char s[nm];
bool check[nm];
long long Pow(int x, int mu) {
  if (mu == 0) return 1ll;
  long long res = Pow(x, mu >> 1);
  res = res * res % MOD;
  if (mu & 1) res = res * x % MOD;
  return res;
}
int main() {
  int i, j, x, y, z, w;
  scanf("%d%d", &n, &m);
  if (m == 3) {
    if (n == 3) {
      cout << "0 0\n1 1\n0 1";
    } else if (n == 4) {
      cout << "0 0\n0 5\n5 0\n1 1";
    } else
      cout << "-1";
  } else {
    for (i = 1; i <= m; i++) {
      cout << i << " " << i * i << "\n";
    }
    for (i = 1; i <= n - m; i++) {
      cout << i << " " << -i * i - 100000 << "\n";
    }
  }
  return 0;
}
