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 inf = 1e9;
template <typename X>
inline X abs(const X &a) {
  return a < 0 ? -a : a;
}
template <typename X>
inline X sqr(const X &a) {
  return a * a;
}
const long double EPS = 1E-9, PI = 3.1415926535897932384626433832795;
const int N = 100 * 1000 + 13;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n, m;
  cin >> n >> m;
  if (m == 3) {
    if (n == 3) {
      cout << 0 << " " << 0 << endl;
      cout << 0 << " " << 1 << endl;
      cout << 1 << " " << 0 << endl;
      return 0;
    } else if (n == 4) {
      cout << 0 << " " << 0 << endl;
      cout << 0 << " " << 10 << endl;
      cout << 10 << " " << 0 << endl;
      cout << 1 << " " << 1 << endl;
      return 0;
    } else if (n >= 5) {
      cout << -1 << endl;
      return 0;
    }
  }
  long long int x = 1e7;
  for (long long int i = 0; i < m; i++) {
    cout << i << " " << x + i * i << endl;
  }
  for (long long int i = 0; i < n - m; i++) {
    cout << i << " " << -x - i * i << endl;
  }
}