POJ3006 Dirichlet's Theorem on Arithmetic Progressions

//#include <bits/stdc++.h>
//define _ ios_base::sync_with_stdio(0);cin.tie(0);

#include <iostream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <bitset>
#include <string>
#include <numeric>
#include <algorithm>
#include <functional>
#include <iterator>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <complex>
#include <ctime>

#define INF 0x3f3f3f3f
#define eps 1e-6

typedef long long LL;
const double pi = acos(-1.0);
const double delta = 1e-9;
const long long mod = 1e9 + 7;
using namespace std;


bool isprime(int x)
{
    if(x == 1)
        return 0;
    if(x == 2)
        return 1;
    for(int i = 2;i < sqrt(x) + 1;i++)
        if(x % i == 0)
            return 0;
    return 1;
}

int main()
{
    //freopen("int.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int a,d,n;
    while(scanf("%d %d %d",&a,&d,&n) == 3)
    {
        if(a == 0 && d == 0 && n == 0)
            return 0;
        int cnt = 0;
        int ans;
        int i = 0;
        for(i = a;cnt < n;i += d)
        {
            if(isprime(i))
                cnt++;
            if(cnt == n)
                break;
        }
        printf("%d\n",i);
    }
    return 0;
}