Description

There is an interesting game played as follows:

Players: $2$;

Props: $N$ stones;

Rules:

1. Players take turns to remove stones;
2. Each player can take any number of stones between $1$ and $K$ (inclusive) in each turn;
3. The game ends when all stones are taken;
4. The player who takes the last stone wins.

Assuming both players are very smart, who will win the game?

Input Format

The input consists of a single line with two integers, $N$ and $K$.

Output Format

Output a single integer: $1$ if the first player wins, or $2$ if the second player wins.

Sample 1

23 3

1

Constraints & Hints

For all test cases, $1 \le N \le 10^5, 1\le K \le N$.