a,b,n=map(int, input().split())
num = a
flag=0
ans=str(a)
for i in range(n):
if num%b==0:
ans+="0"
else:
ost = (num*10)%b
if ost==0:
ans+=str(0)
elif (b-ost)>9:
print(-1)
flag=1
break
else:
ans+=str(b-ost)
num = 0
if flag==0:
print(ans)#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define gcd __gcd
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n , k , num;
string str = "";
cin >> n >> k >> num;
vector<int> vec;
while(num)
{
for(int i = 0 ; i < 10 ; ++i)
{
int temp = n * 10 + i;
if(!(temp % k))
{
auto f = find(vec.begin() , vec.end() , i);
if(f != vec.end())
{
str = to_string(n);
int x = f - vec.begin();
while(num)
{
for(int j = x ; j < vec.size() ; ++j , --num)
{
str += to_string(vec[j]);
if(!num)
break;
}
}
cout << str;
return 0;
}
n = temp;
vec.emplace_back(i);
break;
}
if(i == 9)
{
cout << -1;
return 0;
}
}
--num;
}
cout << n;
return 0;
}
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |