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>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2")
#pragma GCC optimize("trapv")
using namespace std;
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
  cout << *it << " : " << a << endl;
  err(++it, args...);
}
int main() {
  long long int m, n;
  cin >> n >> m;
  if (m == 3) {
    if (n == 3) {
      cout << "0 0" << endl << "0 1" << endl << "1 0";
      return 0;
    } else if (n == 4) {
      cout << "0 0" << endl << "3 0" << endl << "0 3" << endl << "1 1";
      return 0;
    } else if (n >= 5) {
      cout << -1 << endl;
      return 0;
    }
  }
  long long int inf = 10000;
  for (long long int i = 0; i < (m); ++i)
    cout << i << " " << inf + i * i << endl;
  for (long long int i = 0; i < (n - m); ++i)
    cout << i << " " << -inf - i * i << endl;
  return 0;
}