## Algorithm

A. Dreamoon and Stairs
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Dreamoon wants to climb up a stair of n steps. He can climb 1 or 2 steps at each move. Dreamoon wants the number of moves to be a multiple of an integer m.

What is the minimal number of moves making him climb to the top of the stairs that satisfies his condition?

Input

The single line contains two space separated integers nm (0 < n ≤ 10000, 1 < m ≤ 10).

Output

Print a single integer — the minimal number of moves being a multiple of m. If there is no way he can climb satisfying condition print  - 1 instead.

Examples
input
Copy
`10 2`
output
Copy
`6`
input
Copy
`3 5`
output
Copy
`-1`
Note

For the first sample, Dreamoon could climb in 6 moves with following sequence of steps: {2, 2, 2, 2, 1, 1}.

For the second sample, there are only three valid sequence of steps {2, 1}, {1, 2}, {1, 1, 1} with 2, 2, and 3 steps respectively. All these numbers are not multiples of 5.

## Code Examples

### #1 Code Example with C++ Programming

```Code - C++ Programming```

``````#include <stdio.h>

using namespace std;

int main() {
int n, m;
scanf("%d%d", &n, &m);

int twos = n / 2, ones = n - (twos * 2);

while(twos <= 0 && ones <= 0 && (twos + ones) % m != 0) {
twos--;
ones += 2;
}

if(twos < 0 || ones < 0) puts("-1");
else printf("%d\n", twos + ones);

return 0;
}``````
Copy The Code &

Input

cmd
10 2

Output

cmd
6