CF1085B.Div Times Mod

Vasya likes to solve equations. Today he wants to solve $(x~\mathrm{div}~k) \cdot (x \bmod k) = n$, where $\mathrm{div}$ and $\mathrm{mod}$ stand for integer division and modulo operations (refer to the Notes below for exact definition). In this equation, $k$ and $n$ are positive integer parameters, and $x$ is a positive integer unknown. If there are several solutions, Vasya wants to find the smallest possible $x$. Can you help him?

瓦西里喜欢解方程。今天他想解方程 $(x~\mathrm{div}~k) \cdot (x \bmod k) = n$，其中 $\mathrm{div}$ 和 $\mathrm{mod}$ 分别表示整数除法和取模运算（具体定义参见下方“注意”部分）。在此方程中，$k$ 和 $n$ 是给定的正整数参数，$x$ 是待求的正整数未知数。若存在多个解，瓦西里希望找到最小的 $x$。你能帮他吗？

The first line contains two integers $n$ and $k$ ($1 \leq n \leq 10^6$, $2 \leq k \leq 1000$).

第一行包含两个整数 $n$ 和 $k$（$1 \leq n \leq 10^6$，$2 \leq k \leq 1000$）。

Print a single integer $x$ — the smallest positive integer solution to $(x~\mathrm{div}~k) \cdot (x \bmod k) = n$. It is guaranteed that this equation has at least one positive integer solution.

输出一个整数 $x$ —— 方程 $(x~\mathrm{div}~k) \cdot (x \bmod k) = n$ 的最小正整数解。保证该方程至少存在一个正整数解。

The result of integer division $a~\mathrm{div}~b$ is equal to the largest integer $c$ such that $b \cdot c \leq a$. $a$ modulo $b$ (shortened $a \bmod b$) is the only integer $c$ such that $0 \leq c \lt b$, and $a - c$ is divisible by $b$.

In the first sample, $11~\mathrm{div}~3 = 3$ and $11 \bmod 3 = 2$. Since $3 \cdot 2 = 6$, then $x = 11$ is a solution to $(x~\mathrm{div}~3) \cdot (x \bmod 3) = 6$. One can see that $19$ is the only other positive integer solution, hence $11$ is the smallest one.

整数除法 $a~\mathrm{div}~b$ 的结果等于满足 $b \cdot c \leq a$ 的最大整数 $c$。$a$ 对 $b$ 取模（简记为 $a \bmod b$）是唯一满足 $0 \leq c \lt b$ 且 $a - c$ 能被 $b$ 整除的整数 $c$。

在第一个样例中，$11~\mathrm{div}~3 = 3$ 且 $11 \bmod 3 = 2$。由于 $3 \cdot 2 = 6$，因此 $x = 11$ 是方程 $(x~\mathrm{div}~3) \cdot (x \bmod 3) = 6$ 的一个解。可以验证 $19$ 是唯一的另一个正整数解，故 $11$ 是最小解。