codeforces—— 476A —— Dreamoon and Stairs

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 climb1 or 2 steps at each move. Dreamoon wants the number of moves to be a multiple of an integerm.

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 n,m (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

10 2

Output

6

Input

3 5

Output

-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.

一次输入两个数，第一个是n，第二个是m，一共n个台阶，每次上两节或一节，问最小上完台阶的步数（该步数是m的倍数）

思维题，别想着递归会简单很多，各有各的做法，但找规律会简单很多

#include<string>
#include<cstring>
#include<iostream>
#include<vector>
#define min(a,b) (a>b?b:a)
using namespace std;
int main()
{
    int n,m;
    while(cin>>n>>m)
    {
        if(m>n)
            cout<<"-1"<<endl;
        else
        {
            int temp=(n+1)/2;
            if(temp%m==0)
                cout<<temp<<endl;
            else
                cout<<temp/m*m+m<<endl;
        }
    }
    return 0;
}