qwb与小数

#include <iostream> 
#include <cstdio> 
#include <cstdlib> 
#include <cmath> 
#include <algorithm> 
#include <climits> 
#include <cstring> 
#include <string> 
#include <set> 
#include <bitset> 
#include <map> 
#include <queue> 
#include <stack> 
#include <vector> 
#include <cassert> 
#include <ctime> 
#include<unordered_map> 
#define rep(i,m,n) for(i=m;i<=n;i++) 
#define mod 1000000007 
#define inf 0x3f3f3f3f 
#define vi vector<int> 
#define pb push_back 
#define mp make_pair 
#define fi first 
#define se second 
#define ll long long 
#define pi acos(-1.0) 
#define pii pair<int,int> 
#define sys system("pause") 
#define ls rt<<1 
#define rs rt<<1|1 
const int maxn=1e3+10; 
const int N=5e2+10; 
using namespace std; 
ll gcd(ll p,ll q){return q==0?p:gcd(q,p%q);} 
int n,m,k,t; 
ll qpow(ll p,ll q){ll f=1;while(q){if(q&1)f=f*p%m;p=p*p%m;q>>=1;}return f;} 
  
int main() 
{ 
    int i,j; 
    while(~scanf("%d%d%d",&n,&m,&k)) 
    { 
        printf("%lld\n",(n%m)*qpow(10,k-1)%m*10/m); 
    } 
    return 0; 
}