#include <stdio.h>

#include <vector>

#include <map>

using namespace std;

vector<int>bits;

map<int, int> pos;

int div(int a, int b, int n) {

    do {

        pos[a] = (int)bits.size();

        a *= 10;

        bits.push_back(a/b);

        if(pos.count(a%b)) { //找到循环节

            return pos[a%b];

        }

        a %= b;

    } while(1);

}

int get(int n, int p, int len) {

    if(n < p) return bits[n];

    else return bits[(n-p)%len+p];

}

int main() {

    int a, b, n;

    while(scanf("%d%d%d", &a, &b, &n) == 3) {

        pos.clear();

        bits.clear();

        a %= b;

        int p = div(a, b, n);

        int len = bits.size() - p;

        for(int i = n-1; i <= n+1; i++) printf("%d", get(i, p, len));

        puts("");

    }

    return 0;

}