PolandBall has an undirected simple graph consisting of $*n*$ vertices. Unfortunately, it has no edges. The graph is very sad because of that. PolandBall wanted to make it happier, adding some red edges. Then, he will add white edges in every remaining place. Therefore, the final graph will be a clique in two colors: white and red.

Colorfulness of the graph is a value $*min*(*d*_{*r*}, *d*_{*w*})$, where $*d*_{*r*}$ is the diameter of the red subgraph and $*d*_{*w*}$ is the diameter of white subgraph. The diameter of a graph is a largest value $*d*$ such that shortest path between some pair of vertices in it is equal to $*d*$. If the graph is not connected, we consider its diameter to be -1.

PolandBall wants the final graph to be as neat as possible. He wants the final colorfulness to be equal to $*k*$. Can you help him and find any graph which satisfies PolandBall's requests?

Input

The only one input line contains two integers $*n*$ and $*k*$ ($2 ≤ *n* ≤ 1000$, $1 ≤ *k* ≤ 1000$), representing graph's size and sought colorfulness.

Output

If it's impossible to find a suitable graph, print -1.

Otherwise, you can output any graph which fulfills PolandBall's requirements. First, output $*m*$ — the number of red edges in your graph. Then, you should output $*m*$ lines, each containing two integers $*a*_{*i*}$ and $*b*_{*i*}$, ($1 ≤ *a*_{*i*}, *b*_{*i*} ≤ *n*$, $*a*_{*i*} ≠ *b*_{*i*}$) which means that there is an undirected red edge between vertices $*a*_{*i*}$ and $*b*_{*i*}$. Every red edge should be printed exactly once, you can print the edges and the vertices of every edge in arbitrary order.

Remember that PolandBall's graph should remain simple, so no loops or multiple edges are allowed.

Note

In the first sample case, no graph can fulfill PolandBall's requirements.

In the second sample case, red graph is a path from $1$ to $5$. Its diameter is $4$. However, white graph has diameter $2$, because it consists of edges 1-3, 1-4, 1-5, 2-4, 2-5, 3-5.