#include <bits/stdc++.h>
using namespace std;
int n, m;
int x[300], y[300];
int main() {
  cin >> n >> m;
  if (m == 3 && n >= 5) {
    cout << -1 << endl;
    return 0;
  }
  double alph = acos(-1.) / m;
  for (int i = 0; i < m; i++) {
    x[m + i] = 900000 * cos(alph * i);
    x[i] = x[m + i];
    y[m + i] = 900000 * sin(alph * i) - 10000000;
    y[i] = -y[m + i];
  }
  for (int i = 0; i < n; i++) cout << x[i] << ' ' << y[i] << endl;
  return 0;
}

### Prompt

Please create a solution in cpp to the following 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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int n, m;
int x[300], y[300];
int main() {
  cin >> n >> m;
  if (m == 3 && n >= 5) {
    cout << -1 << endl;
    return 0;
  }
  double alph = acos(-1.) / m;
  for (int i = 0; i < m; i++) {
    x[m + i] = 900000 * cos(alph * i);
    x[i] = x[m + i];
    y[m + i] = 900000 * sin(alph * i) - 10000000;
    y[i] = -y[m + i];
  }
  for (int i = 0; i < n; i++) cout << x[i] << ' ' << y[i] << endl;
  return 0;
}

```