Dirichlet's Theorem on Arithmetic Progressions

Good evening, contestants.

If $a$ and $d$ are relatively prime positive integers, the arithmetic sequence beginning with $a$ and increasing by $d$, i.e.,

$a,\ a + d,\ a + 2d,\ a + 3d,\ a + 4d,\ \ldots$

contains infinitely many prime numbers. This fact is known as Dirichlet's Theorem on Arithmetic Progressions, which was conjectured by Johann Carl Friedrich Gauss (1777-1855) and proved by Johann Peter Gustav Lejeune Dirichlet (1805-1859) in 1837.

For example, the arithmetic sequence beginning with 2 and increasing by 3, i.e.,

2, 5, 8, 11, 14, 17, 20, 23, 26, 29, 32, 35, 38, 41, 44, 47, 50, 53, 56, 59, 62, 65, 68, 71, 74, 77, 80, 83, 86, 89, 92, 95, 98, ...

contains infinitely many prime numbers:

2, 5, 11, 17, 23, 29, 41, 47, 53, 59, 71, 83, 89, ...

Your task is to write a program that finds the $n$-th prime number in this arithmetic sequence for given positive integers $a$, $d$, and $n$.

The input is a sequence of datasets. Each dataset is a single line containing three positive integers $a$, $d$, and $n$ separated by spaces, where $a$ and $d$ are relatively prime. You may assume $a \le 9307$, $d \le 346$, and $n \le 210$.

The end of the input is indicated by a line containing three zeros separated by spaces; that line is not a dataset.

For each dataset, output a single line containing one integer: the $n$-th prime number among those in the arithmetic sequence beginning with $a$ and increasing by $d$. The line must not contain any extra characters.

Note: under the given constraints, the answer is always less than $10^6$ (one million).