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 MOD = 1000000007;
const int INF = MOD;
vector<int> a[200];
int cnt = 0;
bool used[200];
void dfs(int v) {
  used[v] = true;
  for (int i = 0; i < a[v].size(); i++)
    if (!used[a[v][i]]) dfs(a[v][i]);
}
bool flag = false;
vector<pair<int, int> > ans;
int main() {
  std::ios_base::sync_with_stdio(false);
  int n, m;
  cin >> n >> m;
  if (m == 3 && (n == 5 || n == 6)) {
    cout << -1 << endl;
    return 0;
  }
  if (m == 3 && n == 4) {
    cout << -1 << " " << 0 << endl;
    cout << 0 << " " << 0 << endl;
    cout << 1 << " " << 1 << endl;
    cout << 1 << " " << -1 << endl;
    return 0;
  }
  int cnt = n;
  for (int i = 0; i < m; i++, cnt--) cout << i << " " << i * i << endl;
  for (int i = 0, x = 4 * m * m; cnt > 0; i++, cnt--, x--)
    cout << x << " " << m * m - i * i << endl;
  return 0;
}