For this Question: A shop sells candies of sweetness ranging from 1 to 1000000000. Price of a candy with sweetness X is <b>A*X + B*f(X)</b> units, where f(X) returns number of digits in the decimal notation of X. Given A, B, and T, find the candy with maximum sweetness that Andy can buy if he has T units of money. If he cannot buy any candy, print 0.The first and the only line of input contains three integers A, B and T.

Constraints:
1 <= A, B <= 10^9
1 <= T <= 10^18Print the maximum sweetness that Andy can buy if he has T units of money. If he cannot buy any candy, print 0.Sample Input 1
10 7 100

Sample Output 1
9

Explanation: Cost of 9 level candy = 9*10 + 7*f(9) = 9*10 + 7*1 = 97.

Sample Input 2
1000000000 1000000000 100

Sample Output 2
0, I have written this Solution Code: a,b,t=map(int,input().split())
if(a+b>t):
	print(0)
	exit()
i=1
j=1000000000
while i<=j:
	m=(i+j)//2
	v1=str(m)
	v=(a*m)+(len(v1)*b)
	if v>t:
		j=m-1
	else:
		ans=m
		i=m+1
print(ans), In this Programming Language: Python, Now tell me if this Code is compilable or not?