Problem:
 Score : 200 points    Problem Statement The development of algae in a pond is as follows.  Let the total weight of the algae at the beginning of the year i be x_i gram. For i≥2000 , the following formula holds:   x_{i+1} = rx_i - D   You are given r , D and x_{2000} . Calculate x_{2001} , ... , x_{2010} and print them in order.      Constraints  2 ≤ r ≤ 5  1 ≤ D ≤ 100  D < x_{2000} ≤ 200  All values in input are integers.         Input Input is given from Standard Input in the following format:  r  D  x_{2000}       Output Print 10 lines. The i -th line ( 1 ≤ i ≤ 10 ) should contain x_{2000+i} as an integer.        Sample Input 1 2 10 20      Sample Output 1 30
50
90
170
330
650
1290
2570
5130
10250  For example, x_{2001} = rx_{2000} - D = 2 \times 20 - 10 = 30 and x_{2002} = rx_{2001} - D = 2 \times 30 - 10 = 50 .       Sample Input 2 4 40 60      Sample Output 2 200
760
3000
11960
47800
191160
764600
3058360
12233400
48933560

Solution (Python):
r, D, x = map(int, input().split())

for i in range(10):
    x = r*x-D
    print(x)

Solution (Python):
r, d, x = map(int,input().split())

n = x
for i in range(10):
    n = r*n - d
    print(n)

Solution (Python):

from collections import deque, defaultdict
from itertools import combinations, combinations_with_replacement
import bisect
from math import factorial, sqrt, log, ceil, floor

def main():
    
    r, D, x = map(int, input().split())

    for i in range(10):
        x = r * x - D
        print(x)


if __name__ == '__main__':
    main()

Solution (Python):
def main() -> None:
    r, D, x = map(int, input().split())
    for _ in range(10):
        x = r * x - D
        print(x)


if __name__ == '__main__':
    main()

Solution (Python):
r,D,x = map(int,input().split())

for i in range(10):
  x = r*x - D
  print(x)

Solution (Python):



def main():
    r, d, x = map(int, input().split())
    for i in range(10):
        x = r * x - d
        print(x)


if __name__ == '__main__':
    main()

Solution (Python):
R,D,X=map(int,input().split())
for i in range(1,11):
    a=X*R-D
    print(a)
    X=a

Solution (Python):
R,D,X=map(int,input().split())
for i in range(1,11):
    a=X*R-D
    print(a)
    X=a

Solution (Python):
r, d, x = [int(x) for x in input().split()]
for i in range(2001, 2011):
  x = r * x - d
  print(x)

Solution (Python):
r, d, x = map(int, input().split())
for i in range(10):
    x = r*x - d
    print(x)

Solution (Python):
r,d,x=map(int,input().split())
for i in range(10):
    x=r*x-d
    print(x)

Solution (Python):
x = list(map(int, input().split()))
tmp = 0
for i in range(0, 10):
  if tmp == 0:
    tmp = x[2]
  tmp = x[0] * tmp - x[1]
  print(tmp)

Solution (Python):
r, d, x = map(int, input().split())
i = 1
while(i<=10):
    x = r*(x)-d
    print(x)
    i += 1

Solution (Python):
r, D, x2000 = map(int, input().split())
result = []
for i in range(10):
  if i == 0:
    result.append(r*x2000-D)
    continue
  result.append(r*result[i-1]-D)
[print(i) for i in result]

Solution (Python):
r, d, x = map(int, input().split())
for i in range(10):
    x = r * x - d
    print(x)

Solution (Python):
r, D, x = map(int, input().split())

for i in range(10):
    x = r*x - D
    print(x)

Solution (Python):
r,d,x = map(int,input().split())
for i in range(10):
    print(r*x-d)
    x = r*x-d

Solution (Python):



def main():
    r, D, x2000 = [int(i) for i in input().split()]
    xi = x2000
    for i in range(10):
        xi = r * xi - D
        print(xi)


if __name__ == '__main__':
    main()

Solution (Python):

r, D, x2000 = map(int, input().split())


x = x2000
for i in range(10):
    x = r * x - D
    print(x)

Solution (Python):
r, D, x = map(int, input().split())

for i in range (1,11):
  print (r*x-D)
  x=r*x-D

Solution (Python):
r,d,x = map(int,input().split())
for i in range(1,11):
    x = r * x - d
    print(x)

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 9)

def main():
    r, d, x = map(int, input().split())
    for _ in range(10):
        x = r * x - d
        print(x)

if __name__ == '__main__':
    main()

Solution (Python):
r,d,x = map(int,input().split())
for i in range(10):
    x = r*x-d
    print(x)

Solution (Python):
r,d,x=map(int,input().split())
for i in range(10): x=(x*r)-d; print(x)

Solution (Python):
r,d,s=map(int,input().split())
l=[0]*11
l[0]=s
for i in range(10):
  l[i+1]=l[i]*r-d
  print(l[i+1])

Solution (Python):
r,d,x=[int(x) for x in input().rstrip().split()]

for i in range(10):
  now=r*x-d
  print(now)
  x=now

Solution (Python):
r, D, x = list(map(int, input().split()))

for _ in range(10):
    x = r * x - D
    print(x)

Solution (Python):
from collections import Counter 
from collections import defaultdict
from collections import deque
import math
import itertools
import heapq
import sys
sys.setrecursionlimit(10**6)




input_list = lambda : list(map(int,input().split()))


a,b,c=input_list()
before=c
for _ in range(10):
    now=before*a-b
    print(now)
    before=now

Solution (Python):
r,D,X = map(int,input().split())
for i in range(10):
    print(r*X-D)
    X = r*X-D

Solution (Python):
from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

r,d,x = mi()
ans=x
for i in range(10):
    ans = r*ans - d
    print(ans)

Solution (Python):
r,d,x=map(int,input().split())
for i in range(10):
  x = x*r-d
  print(x)

Solution (Python):
r,d,x=map(int,input().split())
for ii in range(10):
  x=r*x-d
  print(x)

Solution (Python):
def mass(r, D, x):
    return r*x - D


r, D, x = map(int, input().split())
for _ in range(10):
    x = mass(r, D, x)
    print(x)

Solution (Python):
r, d, x0 = list(map(int, input().split()))
for _ in range(10):
    x = r * x0 - d
    print(x)
    x0 = x

Solution (Python):
import itertools
import math
import fractions
import functools
import copy
r, d, x = map(int, input().split())

for i in range(10):
    x = r*x-d
    print(x)

Solution (Python):
r,D,x = map(int,input().split())

for i in range(10):
  x_ne = r*x-D
  print(x_ne)
  x = x_ne

Solution (Python):
r,d,x=map(int,input().split())

for i in range(10):
    print(r*x-d)
    x=r*x-d

Solution (Python):
r, d, x = map(int, input().split())
for i in range(10):
    next = r*x-d
    print(next)
    x = next

Solution (Python):
r,d,x=map(int,input().split())
k=0
for i in range(10):
    x=r*x-d
    print(x)

Solution (Python):
import math
import time
from collections import defaultdict, deque
from sys import stdin, stdout
from bisect import bisect_left, bisect_right
r,d,x=map(int,stdin.readline().split())
ans=x 
for _ in range(10):
    ans=(r*ans)-d 
    print(ans)

Solution (Python):






import sys
input = sys.stdin.readline

import math
import bisect
from collections import deque
from fractions import gcd
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr


def lcm(a, b):
    return a * b // gcd (a, b)


def bit_count(n):
  count = 0
  while n:
    n &= n -1
    count += 1
  return count





r,d,x = inputIL()

for i in range(10):
  new_x = x*r-d
  x = new_x
  print(x)

Solution (Python):
r, D, x0 = map(int, input().split())
for i in range(10):
    x0 = x0*r-D
    print(x0)

Solution (Python):
r, d, x = map(int, input().split())

for i in range(10):
    x = r * x - d
    print(x)

Solution (Python):
r, d, x = map(int, input().split())

for i in range(10):
    x = r * x - d
    print(x)

Solution (Python):
r,D,x2000 = map(int,input().split())

for i in range(0,10):
    x2000 = r*x2000-D
    print(x2000)

Solution (Python):
import sys
input = sys.stdin.readline
def main():
    r, D, Xtt = map(int, input().split())
    ans = Xtt
    for i in range(10):
        ans = r*ans - D
        print(ans)

if __name__ == '__main__':
    main()

Solution (Python):
r, d, x = map(int, input().split())
for i in range(10):
    x = r * x - d
    print(x)

Solution (Python):
r,D,x=map(int,input().split())
for _ in range(10):
    x= r*x -D
    print(x)

Solution (Python):
def main():
    inp=list(map(lambda x:int(x),input().split()))
    r=inp[0]
    D=inp[1]
    x=inp[2]

    res_array=[]
    for i in range(10):
        x=r*x-D
        res_array.append(x)

    for i in res_array:
        print(i)


if __name__=="__main__":
    main()

Solution (Python):
r, D, x = map(int, input().split())
for i in range(10):
    x = r * x -D
    print(x)

Solution (Python):
r,D,x = map(int,input().split())
l = [x]
for i in range(10):
    x = r*x - D
    print(x)

Solution (Python):
r, d, x = map(int,input().split())
for i in range(10):
    x = r*x - d
    print(x)

Solution (Python):
a,b,c=map(int,input().split())
ans=[c]
for i in range(10):
    ans.append(ans[i]*a-b)
    print(ans[i+1])

Solution (Python):
r, d, x = map(int, input().split())

for i in range(10):
    x = r * x - d
    print(x)

Solution (Python):
r, d, x2000 = list(map(int, input().split()))




x = [x2000]
for i in range(10):
    b = r*x[i]-d
    x.append(b)
    print(b)

Solution (Python):
r,d,x = map(int,input().split())
for i in range(10):
    x = r*x-d
    print(x)

Solution (Python):
def main():
    r, D, x = map(int, input().split())
    for i in range(1, 11):
        k = r * x - D
        x = k
        print(k)


if __name__ == "__main__":
    main()

Solution (Python):
import sys
import math
import bisect


def main():
    r, d, x = map(int, input().split())
    A = []
    for _ in range(10):
        x = r * x - d
        A.append(x)
    for a in A:
        print(a)

if __name__ == "__main__":
    main()

Solution (Python):
a,b,c=map(int,input().split())
d=0
while d<10:
  c=a*c-b
  print(c)
  d+=1

Solution (Python):
r, D, x2000 = map(int, input().split())
ans = [x2000]
for i in range(10):
    ans.append(r * ans[i] - D)
for i in range(1, 11):
    print(ans[i])

Solution (Python):
r,D,x2000 = map(int,input().split())
a = x2000
b = 0
for i in range(10):
  b = r*a - D
  print(b)
  a = b

Solution (Python):
r, D, x = map(int, input().split())
for _ in range(10):
    x = r*x - D
    print(x)

Solution (Python):
r, d, x = map(int, input().split())

for i in range(10):
    x = r*x - d
    print(x)

Solution (Python):
r, d, x = map(int, input().split())
t = 0

for i in range(10):
  t =r*x-d
  print(t)
  x = t

Solution (Python):
r,d,x = map(int,input().split())
for i in range(10):
    x = r*x-d
    print(x)

Solution (Python):
r, D, x = map(int,input().split())
for i in range(10):
    x = r*x-D
    print(x)

Solution (Python):
r, D, x = map(int, input().split())

for i in range(10):
    x = r * x - D
    print(x)

Solution (Python):
r, D, x = map(int, input().split())

ans = [None]*11
ans[0] = x

for i in range(1, 11):
    ans[i] = ans[i-1] * r - D
    print(ans[i])

Solution (Python):
r,D,x_2000 = map(int,input().split())


X=[x_2000]
for i in range(10):
    X.append(r*X[i] - D)


print(*X[1:],sep="\n")

Solution (Python):
r,d,x=map(int,input().split())
count=0
num=x
for i in range(10):
    count=num*r-d
    num=count
    print(num)

Solution (Python):
a,b,c=map(int,input().split())

for i in range(10):
  d=a*c-b
  print(d)
  c=d

Solution (Python):
r,d,X=map(int,input().split())
x=[X]
for i in range(10):
    x.append(r*x[i]-d)
del x[0]

for i in range(len(x)):
    print(x[i])

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
from fractions import gcd
import sys
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = float('inf')


r, d, x = Is()
for i in range(10):
    x = r*x-d
    print(x)

Solution (Python):
r, d, x = map(int, input().split())

for i in range(10):
  x = x*r-d
  print(x)

Solution (Python):
r, D, x = list(map(int,input().split()))
for _ in range(10):
    x = r*x-D
    print(x)

Solution (Python):
r, D, x2000 = map(int, input().split())

x2001 = r*x2000-D

print(x2001)

xx = x2001

for i in range(1, 10):
    xx = xx*r-D
    print(xx)

Solution (Python):
r ,D ,x = map(int,input().split())
for i in range(10):
    print(x*r-D)
    x=x*r-D

Solution (Python):


r, D, x = map(int, input().split())
for _ in range(10):
    x = r * x - D
    print(x)

Solution (Python):
r,d,x2000=map(int,input().split())
xnow=x2000
for i in range(10):
  xnext = r*xnow - d
  print(xnext)
  xnow = xnext

Solution (Python):
r, D, x = map(int, input().split())
for i in range(10):
    x = r * x - D
    print(x)

Solution (Python):
r, D, x = map(int, input().split())
for _ in range(10):
    x = r * x - D
    print(x)

Solution (Python):
x = [None]*11

r, d, x[0] = map(int, input().split())

for i in range(10):
    x[i+1] = r*x[i] - d
    print(x[i+1])

Solution (Python):
def algae(r, d, x):

    ans = []
    count = x
    for i in range(1, 11):
        count = r*count - d
        ans.append(count)
    return ans

def main():
    r, d, x = map(int, input().split())
    ans = algae(r, d, x)
    for i in ans:
        print(i)

if __name__ == '__main__':
    main()

Solution (Python):


R, D, X = map(int, input().split())

Plus = X
for i in range(10):
    print((R*Plus)-D)
    Plus=(R*Plus)-D

Solution (Python):
r, D, x = list(map(int, input().split()))
X = [x]
for i in range(11):
  X.append(r*X[i]-D)

for j in range(1,11):
  print(X[j])

Solution (Python):
r,D,x=map(int,input().split())

X=[x]
for i in range(10):
    a = r*X[i]-D
    X.append(a)
    print(a)

Solution (Python):

r, d, x = map(int, input().split())
xi = [[] for i in range(11)]
xi[0] = x
for i in range(10):
    xi[i + 1] = xi[i] * r - d
xi = xi[1:11]
print(*xi, sep='\n')

Solution (Python):
r,d,x = map(int,input().split())
now = x
for i in range(10):
    now = r*now-d
    print(now)

Solution (Python):
r,d,x = map(int,input().split())
for i in range(10):
    x = (r*x)-d
    print(x)

Solution (Python):
r,d,x = map(int, input().split())
for _ in range(10):
  x = r*x - d
  print(x)

Solution (Python):
r,D,x=map(int,input().split())
for i in range(10):
    x=r*x-D
    print(x)

Solution (Python):
r, d, x = map(int, input().split())
for i in range(10):
    x = r * x - d
    print(x)

Solution (Python):
li = input().split()
x = int(li[2])
D = int(li[1])
r = int(li[0])

for i in range(0,10,1):
    xx = r*x -D
    print(xx)
    x = xx

Solution (Python):
r, D, xi = map(int, input().split())
base=xi
for i in range(1, 11):
    ret = r * base - D
    base = ret
    print(ret)

Solution (Python):
r, D, x = map(int, input().split())
for i in range(10):
  x = r*x -D
  print(x)

Solution (Python):
r, d, x = map(int, input().split())

for i in range(10):
    x = r * x - d
    print(x)

Solution (Python):
r, d, x = map(int, input().split())

for i in range(10):
    x = r * x - d
    print(x)

Solution (Python):
r, d, x = map(int, input().split())
for i in range(10):
    x = r * x - d
    print(x)

Solution (Python):
r, d, x = map(int, input().split())

for i in range(10):
    x = r*x - d
    print(x)

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():
    r,d,x=map(int, input().split())
    for i in range(10):
        x=r*x-d
        print(x)

resolve()

Solution (Python):
r, D, x2000 = map(int, input().split())
x = x2000
for i in range(10):
    x = r * x - D
    print(x)

Solution (Python):
r,d,x=map(int,input().split())

for i in range(10):
  x=r*x-d
  print(x)

Solution (Python):

r, d, x = map(int, input().split())
x_list = [0] * 11
x_list[0] = x
for i in range(10):
    x_list[i+1] = (r * x_list[i]) - d
for _ in range(10):
    print(x_list[_+1])

Solution (Python):
r,d,x = map(int,input().split())
for i in range(10):
    x = r*x - d
    print(x)

Solution (Python):
r, d, x = map(int, input().split())
y = [x]
for i in range(10):
    y.append(r * y[i] - d)
    print(r * y[i] - d)

Solution (Python):
r, D, x2000 = map(int, input().split())

x_add = x2000
for i in range(10):
  x_print = r * x_add - D
  print(x_print)
  x_add = x_print

Solution (Python):
r,d,x=map(int,input().split())

def f(i):
  if i==0:
    return x
  else:
    return r*f(i-1)-d

for i in range(10):
  print(r*f(i)-d)

Solution (Python):


r,D,x2000 = map(int,input().split())

x_cur = x2000
for i in range(2001,2011):
    x_cur = r*x_cur-D
    print(x_cur)

Solution (Python):
r, D, X0 = map(int, input().split())
for i in range(10):
  X0 = r*X0 - D
  print(X0)

Solution (Python):
r,d,x  = map(int,input().split())
t = 2000
while t <= 2009:
  x = r*x-d
  print(x)
  t += 1

Solution (Python):
r,d,x = map(int,input().split())

for i in range(10):
  x = r*x - d
  print(x)

Solution (Python):
r, d, x = map(int, input().split())
xi = x
for i in range(10):
  xi *=  r 
  xi -= d
  print(xi)

Solution (Python):

r, D, x0 = list(map(int,input().split()))

x = [None for _ in range(10)]

x.insert(0,x0)

for i in range(1,11):
  x[i] = r * x[i-1] - D
  print(x[i])

Solution (Python):
r, D, x0 = list(map(int,input().split()))
x = [None for _ in range(10)]
x.insert(0,x0)
for i in range(1,11):
  x[i] = r * x[i-1] - D
  print(x[i])

Solution (Python):
r,d,x=map(int,input().split())
for i in range(10):
    x=r*x-d
    print(x)

Solution (Python):
r, D, x2000 = map(int, input().split())

for i in range(1, 11):
  print(r*x2000-D)
  x2000 = r*x2000-D

Solution (Python):
r,d,x = map(int,input().split())

for i in range(10):
    x = r*x - d
    print(x)

Solution (Python):
import sys
import math
from collections import Counter
import itertools



def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())

def LI(): return list(map(int, sys.stdin.readline().split()))

def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SR(): return sys.stdin.readline().rstrip()

ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
ascii_uppercase2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ'


p2D = lambda x: print(*x, sep="\n")
p2E = lambda x: print(''.join(x))
p2S = lambda x: print(*x, sep=" ")



r,D,x=MI()
bef=x
for i in range(1,11):
    print(r*bef-D)
    bef=r*bef-D

Solution (Python):
def bbb(x,r,d):
	return r*x-d

r,d,x=map(int,input().split())
for _ in range(10):
	print(bbb(x,r,d))
	x=bbb(x,r,d)

Solution (Python):
r, D, x = map(int, input().split())

for i in range(10):
    ans = r * x - D
    print(ans)
    x = ans

Solution (Python):
import sys
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from fractions import gcd 
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // gcd(x, y)) 

r, d, x = map(int, input().split())
for i in range(10):
    x = r*x - d
    print(x)

Solution (Python):
r,d,x=map(int,input().split())
for i in range(10):
    x=r*x-d
    print(x)

Solution (Python):
r, D, x = map(int, input().split())

for i in range(10):
    x = r * x - D
    print(x)

Solution (Python):
r,d,x=map(int,input().split())
for i in range(10):
  x=r*x-d
  print(x)

Solution (Python):
r, D, x = map(int, input().split())
for i in range(10):
    x = r * x - D
    print(x)

Solution (Python):
r, D, x = map(int, input().split())
for i in range(10):
    print(r * x - D)
    x = r * x - D

Solution (Python):
r,d,x=map(int,input().split())

for i in range(10):
    x=r*x-d
    print(x)

Solution (Python):
r, D, A = map(int, input().split())

for i in range(10):

    A = r * A - D
    print(A)

Solution (Python):
r, d, x_2000 = map(int, input().split())
x = [0]*11
x[0] = x_2000
for i in range(10):
    x[i+1] = r*x[i] - d
    print(x[i+1])

Solution (Python):

r,d,x_2000=map(int,input().split())

def X(n):    
    if n == 1:return x_2000
    else:return r*X(n-1)-d
lis=[X(n) for n in range(2,12)]
[print(i) for i in lis]

Solution (Python):
r, d, x = map(int, input().split())

for i in range(10):
    x = r*x - d
    print(x)

Solution (Python):
A,B,C = list(map(int,input().split()))
for i in range(10):
    C = C * A -B
    print(C)

Solution (Python):
r, D, x = map(int, input().split())

for i in range(1, 11):
  x = r * x - D
  print(x)

Solution (Python):
r,d,x0=map(int,input().split())
list=[x0]
for i in range(1,11):
  list.append(r*list[i-1]-d)
list.remove(x0)
for x in range(10):
  print(list[x])

Solution (Python):
r,D,x = map(int,input().split())
X = [x]*11

for i in range(0,10):
  X[i+1] = r*X[i] - D
  
  
print(X[1])
print(X[2])
print(X[3])
print(X[4])
print(X[5])
print(X[6])
print(X[7])
print(X[8])
print(X[9])
print(X[10])

Solution (Python):
r,D,xi = map(int, input().split())
for i in range(10):
  xi = r * xi - D
  print(xi)

Solution (Python):
r, D, x = map(int,input().split())

for _ in range(10):
    ans = r*x-D
    print(ans)
    x = ans

Solution (Python):
r,d,x=map(int,input().split())

for i in range(10):
    ans=r*x-d
    print(ans)
    x=ans

Solution (Python):
r, D, x = map(int, input().split())
for i in range(10):
    x = r*x-D
    print(x)

Solution (Python):
r,d,x=map(int,input().split())
a=r*x-d
print(a)
for i in range(9):
  a=r*a-d
  print(a)

Solution (Python):
r, d, x = map(int, input().split())
first = r*x - d
ls = [first]
for i in range(9):
    tmp = (ls[len(ls) - 1]) * r - d
    ls.append(tmp)

for i in ls:
    print(i)

Solution (Python):
r,d,x = map (int,input().split())
for i in range(10):
    print(r*x-d)
    x=r*x-d

Solution (Python):
r,d,x_2000=map(int,input().split())

for i in range(10):
    x_2000=r*x_2000-d
    print(x_2000)

Solution (Python):
r,d,x_2000=map(int,input().split())

for i in range(10):
    x_2000=r*x_2000-d
    print(x_2000)

Solution (Python):
r,d,x_2000 = map(int,input().split())

for i in range(10):
    
    x_2000 = r*x_2000-d
    print(x_2000)

Solution (Python):
r,d,a = map(int,input().split())

ans = a
for i in range(10):
  ans = ans*r-d
  print(ans)

Solution (Python):
r,d,x=map(int,input().split())
for i in range(10):
    x=r*x-d
    print(x)

Solution (Python):
r, D, x = map(int, input().split())

i = 1
while i <= 10:
  x = int(r * x - D)
  print(x)
  i += 1

Solution (Python):
r, D, x=map(int, input().split())

for i in range(1,11):
    x = r*x -D
    print(x)

Solution (Python):

r,d,x = map(int,input().split())
n = 10
for i in range(n):
  x = x*r - d
  print(x)

Solution (Python):
r, d, x = [int(n) for n in input().split()]
for _ in range(10):
    x = r * x - d
    print(x)

Solution (Python):
r, D, x2000 = map(int, input().split())
ans = [x2000]

for i in range(10):
    ans.append(ans[i] * r - D)
    print(ans[i + 1])

Solution (Python):


import sys



















def main():
    mod = 1000000007                  
    inf = float('inf')
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():  return int(input())
    def mi():  return map(int, input().split())
    def mi_0(): return map(lambda x: int(x)-1, input().split())
    def lmi(): return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():  return list(input())
    
    
    r, d, start = mi()
    prev = start
    for _ in range(10):
        current = r * prev - d
        print(current)
        prev = current

if __name__ == "__main__":
    main()

Solution (Python):
r, d, x = map(int, input().split())
for i in range(10):
    x = r*x-d
    print(x)

Solution (Python):

r, d, x = map(int, input().split())
for i in range(10):
    x = r*x-d
    print(x)

Solution (Python):
r,D,x=map(int,input().split())
for i in range(10):
  x=r*x-D
  print(x)

Solution (Python):
r, d, x = map(int, input().split())

ans = r * x - d
for i in range(10):
    print(ans)
    ans = r * ans - d

Solution (Python):
r, d, x = map(int, input().split())
for i in range(10):
    x = r * x - d
    print(x)

Solution (Python):
import sys

r,d,x2000 = map(int, input().split())
tmp = x2000
ans = ''

for y in range(2001, 2011):
    result = r * tmp - d
    tmp = result
    print(result)

Solution (Python):
r, d, x = map(int,input().split())
for i in range(10):
  x = r * x - d
  print(x)

Solution (Python):
r,d,x = list(map(int,input().split()))

ans =x*r-d
for i in range(10):
    print(ans)
    ans = ans*r-d

Solution (Python):
import sys
r, D, x2000 = map(int, sys.stdin.readline().split())
x2001 = r * x2000 - D
x2002 = r * x2001 - D
x2003 = r * x2002 - D
x2004 = r * x2003 - D
x2005 = r * x2004 - D
x2006 = r * x2005 - D
x2007 = r * x2006 - D
x2008 = r * x2007 - D
x2009 = r * x2008 - D
x2010 = r * x2009 - D
print(x2001)
print(x2002)
print(x2003)
print(x2004)
print(x2005)
print(x2006)
print(x2007)
print(x2008)
print(x2009)
print(x2010)

Solution (Python):
r, D, x = map(int, input().split())
for i in range(10):
  x = r*x - D
  print(x)

Solution (Python):
r,D,x=map(int,input().split())
A=[]


for i in range(1,11):
    B=r*x-D
    A.append(B)
    x=B
for s in A:
    print(s)

Solution (Python):
factor, sub, year = map(int, input().split())
weight = 0

for x in range(1, 11):
    if x == 1:
        weight = factor * year * x - sub
    else:
        weight = factor * weight - sub
    print(weight)

Solution (Python):
r, d, x = map(int, input().split())
for i in range(10):
  x = x * r - d
  print(x)

Solution (Python):
r,D,x0=map(int,input().split())
X=[x0]
for _ in range(10):
  X.append(0)
for i in range(10):
  X[i+1]=r*X[i]-D
for i in range(1,11):
  print(X[i])

Solution (Python):
r,D,x = map(int,input().split())

w = x
for _ in range(10):
    print(r*w-D)
    w = r*w-D

Solution (Python):

r,d,x2000 = map(int,input().split())
X = [x2000]

for i in range(10):
    X.append(r*X[i]-d)

for i in range(1,len(X)):
    print(X[i])

Solution (Python):


r, d, x = map(int, input().split())

for _ in range(10):
    x = x*r-d
    print(x)

Solution (Python):


r, d, x = map(int, input().split())

for _ in range(1, 11):
    x = x*r-d
    print(x)

Solution (Python):
r,D,x=map(int,input().split(" "))

for i in range(1,11):
    X=x*r-D
    print(X)
    x=X

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    

    
    

    r,d,x = map(int, input().split())
    for i in range(10):
        x = r*x-d
        print(x)

if __name__ == '__main__':
    main()

Solution (Python):
r, D, x = map(int, input().split())
for i in range(10):
  x = r * x - D
  print(x)

Solution (Python):
r,d,x = map(int,input().split())
now = x
for i in range(10):
  now = r*now-d
  print(now)

Solution (Python):
r, d, x = map(int, input().split())
for i in range(1, 11):
    x = r * x - d
    print(x)

Solution (Python):
r,d,x=map(int,input().split())
for i in range(10):
  x=r*x-d
  print(x)

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

r, D, x = MAP()

for i in range(1, 11):
	x *= r
	x -= D
	print(x)

Solution (Python):
r, D, x = map(int, input().split())

for a in range(10):
    x = x * r - D
    print(x)

Solution (Python):
r,D,x = map(int,input().split())
for i in range(10):
    x = r*x - D
    print(x)

Solution (Python):
r,d,x = list(map(int,input().split()))
for _ in range(10):
  x = r*x-d
  print(x)

Solution (Python):

r, D, x = map(int, input().split())

for _ in range(10):
    x = x * r - D
    print(x)

Solution (Python):
r,d,x = map(int,input().split())

for i in range(10):
    ans = r*x - d
    print(ans)
    x = ans

Solution (Python):

r,D,x_2000 = map(int, input().split())

x = x_2000
for i in range(10):
  x = r * x - D
  print(x)

Solution (Python):
r,D,x=map(int,input().split())
x_pre=x
for i in range(10):
    X=r*x_pre-D
    x_pre=X
    print(X)

Solution (Python):
r, D, x2000 = map(int, input().split())

xs = []
x = x2000
for _ in range(10):
    x = r*x - D
    xs.append(x)

print('\n'.join(map(str, xs)))

Solution (Python):
icase=0
if icase==0:
    r,d,x=map(int,input().split())
    for i in range(10):
        x=r*x-d
        print(x)

Solution (Python):
r,D,x=map(int, raw_input().split())
for _ in range(10):
    x=r*x-D
    print x

Solution (Python):
r,d,x=map(int,input().split())
n=x
for i in range(10):
    print(r*n-d)
    n=r*n-d

Solution (Python):
r, d, x = map(int, input().split())

for _ in range(10):
  x = r*x - d
  print(x)

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')
MOD = 10**9+7


def main():
  r, D, x = map(int, readline().split())
  for _ in range(10):
    x = r*x -D
    print(x)
  
  
if __name__ == '__main__':
  main()

Solution (Python):
r,d,x = map(int, input().split())
i = 0
for i in range(1,11):
    x = r*x-d
    print(x)
    i+=1