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,x2k = map(int, input().split())

xi = x2k
for i in range(10):
    xip1 = r * xi - D
    xi = xip1
    print(xi)

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

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(1, 11):
  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 = map(int,input().split())

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

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

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

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

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())
output = x
for i in range(10):
    print(r*output-d)
    output = r*output-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, x2000 = map(int, input().split())

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

Solution (Python):

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

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

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

Solution (Python):
r,d,x=list(map(int, list(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 = [int(i) for i in input().split()]

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

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())

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

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

list = []
for i in range(10):
  if i == 0:
    ans = r * x - D
    list.append(ans)
    continue
  ans = r * list[-1] - D
  list.append(ans)

for num in list:
  print(num)

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

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

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

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

while i < 2010:
    x = r * x - d
    print(x)
    i = i + 1

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

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

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

Solution (Python):
import numpy as np
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())
j = True
count = 0
while j:
    a = (r*x)-d
    x = a
    count+=1
    if count ==10:
        j = False
    print(a)

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):
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):
x = [0]*11
r,D,x[0] = map(int, input().split())

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,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):
    tmp = r*x-d
    print(tmp)
    x = tmp

Solution (Python):
import numpy as np

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(1,11):
  ans = r*x - D
  print(ans)
  x = ans

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

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())

def do(r,D,X,cnt):
  X = r*X-D
  print(X)
  cnt+=1
  if cnt!=10:
  	do(r,D,X,cnt)

cnt=0
do(r,D,X,cnt)

Solution (Python):
r, d, x = [int(_) for _ in 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(2001, 2011):
    x = r*x - d
    print(x)

Solution (Python):
i = input().split(" ")
l = [int(j) for j in i]
r = l[0]
d = l[1]
x_last = l[2]

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

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):

tmp = [int(el) for el in input().split(' ')]
r = tmp[0]
d = tmp[1]
X = [0 for i in range(11)]
X[0] = tmp[2]


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, 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=x*r-d
	print(x)

Solution (Python):
r,D,x = [int(s) for s in 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):
def f(r, D, x):
    return r*x - D


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

for _ in range(10):
    x = f(r, D, x)
    print(x)

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

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

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

ans=[x]

for i in range(10):
    ans.append(r * ans[i] - D) 
for i in range(10):
    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,x=map(int,input().split())

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

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

Solution (Python):
r, d, x = map(int,input().split())
x_i = x
for _ in range(10):
  x_i = x_i*r-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,x=map(int,input().split())
ans=r*x-d
print(ans)
for i in range(9):
  ans = (ans*r)-d
  print(ans)

Solution (Python):
R,D,X = list(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):
def main21():
    data = input().split()
    num = []
    for i in range(3):
        num.append(int(data[i]))
    for i in range(10):
        num[2] = num[2] * num[0] - num[1]
        print(num[2])

if __name__ == "__main__":
    main21()

Solution (Python):
r, D, x = list(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):
    print(r*x - d)
    x = r*x - d

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

Solution (Python):
r, D ,a = map(int,input().split())
l  = [0] * 11
l[0] = a
for i in range(1,11):
    l[i] = r*l[i-1] - D
    print(l[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, 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 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 _ in range(10):
  x = x*r-d
  print(x)

Solution (Python):
r,d,x = map(int,input().split())
for i in range(0,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):
  print(r*x - D)
  x = r*x - D

Solution (Python):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
sys.setrecursionlimit(1000000)
mod = 1000000007



def A():
    a,b = LI()
    if a > 12:
        print(b)
    elif a > 5:
        print(b//2)
    else:
        print(0)
    return


def B():
    r,d,x = LI()
    for i in range(10):
        x = r*x-d
        print(x)
    return


def C():
    n,m = LI()
    t = [0 for i in range(n+1)]
    for i in range(m):
        l,r = LI()
        t[l-1] += 1
        t[r] -= 1
    for i in range(n):
        t[i+1] += t[i]
        if t[i] == m:
            t[i] = 1
        else:
            t[i] = 0
    print(sum(t[:n]))
    return


def D():
    n,m = LI()
    a = LI()
    q = []
    for i in range(n):
        heappush(q,a[i])
    l = LIR(m)
    l.sort(key = lambda x:-x[1])
    for b,c in l:
        for i in range(b):
            x = heappop(q)
            if x < c:
                x = c
                heappush(q,x)
            else:
                heappush(q,x)
                break
    print(sum(q))
    return


def E():
    n,m,k = LI()
    M = n*m
    fact = [1]*(M+1)
    for i in range(M):
        fact[i+1] = fact[i]*(i+1)%mod
    inv = [1]*(M+1)
    inv[M] = pow(fact[M],mod-2,mod)
    for i in range(M)[::-1]:
        inv[i] = inv[i+1]*(i+1)%mod
    ans = fact[M-2]*inv[k-2]*inv[M-k]%mod
    s = 0
    for i in range(M):
        s += i*(max(0,n-i)*m**2+max(0,m-i)*n**2)%mod
        s %= mod
    ans = ans*s%mod
    print(ans)
    return


def F():
    q = I()
    m = 0
    l = [-float("inf"),float("inf")]
    x = 0
    num = 0
    for _ in range(q):
        Q = LI()
        if len(Q) == 1:
            print(x,m)
        else:
            z,a,b = Q
            m += b
            if num == 0:
                num += 1
                l = [a,float("inf")]
                x = a
            elif num == 1:
                if a != l[0]:
                    num += 1
                    l = [min(a,l[0]),max(a,l[0])]
                    x = l[0]
                    m += l[1]-l[0]
            else:
                num += 1
                if num % 2:
                    if l[0] <= a < l[1]:
                        m += min(a-l[0],l[1]-a)
                        x = a
                    elif a < l[0]:
                        m += l[0]-a
                        x = l[0]
                        l = [a,l[1]]
                    else:
                        m += a-l[1]
                        x = l[1]
                        l = [l[0],a]
                else:
                    if l[0] <= a < l[1]:
                        if a < x:
                            m += x-a
                            l = [a,x]
                            x = a
                        else:
                            m += a-x
                            l = [x,a]
                    elif a < l[0]:
                        m += x-a
                        x = l[0]
                        l = [l[0],x]
                    else:
                        m += a-x
                        l = [x,l[1]]
    return


def G():
    return


def H():
    return


def I_():
    return


def J():
    return


if __name__ == "__main__":
    B()

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):
a, b, c = map(int, input().split())

x = c
for i in range(10):
    x = a * x - b
    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 = 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_20000  = list(map(int, input().split()))

x = [0] * 11

for j in range(0,11):
    if j == 0 :
        x[j] = x_20000
    else :
        x[j] = x[j - 1] * r - D
        print(x[j])

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

Solution (Python):
from itertools import accumulate
r, D, x_2000 = map(int, input().split())

ans = '\n'.join(
    [
        str(x)
        for x in accumulate(
            [x_2000] + list(range(10)),
            lambda acc, _: r * acc - D
        )
    ][1:]
)

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 = list(map(int, input().split()))

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

Solution (Python):


r,d,x = map(int,input().split()) 
x_i = [x]*11 
for i in range(1,11,1):
  x_i[i] = x_i[i-1]*r - d
  print(x_i[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,x = map(int, input().split())

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

Solution (Python):
import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in ss]
ss2nnn = lambda ss: [s2nn(s) for s in ss]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]
ii2sss = lambda n: [list(sys.stdin.readline().rstrip()) for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main():
    r, D, x = i2nn()
    for i in range(10):
        x = r * x - D
        print(x)

main()

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 = list(map(int, input().split()))

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

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

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

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

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

x_200i = r*x_2000 - D
print(x_200i)

for i in range(9):
  x_200i = r*x_200i - D
  print(x_200i)

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

Solution (Python):
r, D, x = map(int, input().split())
for i in range(0, 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 num in range(10):
    print(r * x - d)
    x = r * x - d

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


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

Solution (Python):
import sys
from collections import deque

sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def solve(inputs):
    [r, D, x] = string_to_int(inputs[0])

    ret = deque([x])
    for _ in range(0, 10):
        ret.append(r * ret[-1] - D)

    ret.popleft()
    ret_str = ""
    for i in ret:
        ret_str += "{:d}\n".format(i)
    ret_str.strip()

    return ret_str


def string_to_int(string):
    return list(map(lambda x: int(x), string.split()))


if __name__ == "__main__":
    ret = solve(inputs(1))
    print(ret)

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

Solution (Python):
R,D,X = list(map(int,input().split()))
x = 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):
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):
data=list(map(int,input().rstrip().split()))

for i in range(10):
  data[2]=data[2]*data[0]-data[1]
  print(data[2])

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

for i in range(10):
    xi_1 = r * x - d
    print(xi_1)
    x = xi_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())

x_i  = [x]
for i in range(10):
    x_i.append(0)
    x_i[i + 1] = r * x_i[i] - d

for i in range(10):
    print(x_i[i + 1])

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,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)
  x=X

Solution (Python):
def cal_x(r,D,x,counter):
    y = r*x-D
    print(y)
    counter += 1
    if counter <10:
        cal_x(r,D,y,counter)


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

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())
x = x2000
for _ in range(10):
    x = r * x - d
    print(x)

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
while(N):
    x_next = r * x - D
    x = x_next
    print(x)
    N -= 1

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

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

Solution (Python):


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

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

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




ls = [x]

for i in range(10):
  ls.append(ls[i] * r - d)
  
ls.remove(ls[0])
for i in ls:
  print(i)

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

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

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

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

Solution (Python):
r, d, x = map(int, input().split())
kusa_list = [x*r-d]

for i in range(9):
    kusa_list.append(kusa_list[i]*r-d)

for kusa in kusa_list:
    print(kusa)

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

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

Solution (Python):
a,b,c=map(int,input().split())
for i in range(10):
  res=c*a-b
  print(res)
  c=res

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

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

L = [x]
add = int(0)
for i in range(10):
    L.append(add)
    L[i+1]=r*L[i]-D
    print(L[i+1])

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

x_before = x

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

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

num = x

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

Solution (Python):
r,d, x = map(int,input().split())
for a in range(1,11):
    y = x*r-d
    print('{}'.format(y))
    x = y

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(1,10+1):
    ans = r*x-D
    print(ans)
    x = ans

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

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= [int(_) for _ in input().split()]

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

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

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

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

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

Solution (Python):
r, d, x = list(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())
lst = [r * x - D]
for i in range(1, 10):
    lst.append(lst[i - 1] * r - D)

for n in lst:
    print(n)

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())
count = 0
for i in range(10):
  if count == 10:
    break
  else:
    x = r*x-d
    count += 1
    print(x)

Solution (Python):

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

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

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

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

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

if __name__ == '__main__':
    main()

Solution (Python):
R,D,X = list(map(int, input().split()))

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

Solution (Python):
r, D, x = [int(i) for i in input().split()]
i = 1
while i<=10:
  x = r*x - D
  print(x)
  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, x = map(int, input().split())
ans_list = [x]
for i in range(10):
    ans_list.append(r*ans_list[i]-d)
for i in range(1, 11):
    print(ans_list[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,x= (int(x) for x in input().split())
for val in range(10):
    x = r*x - D
    print(x)

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

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

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

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

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

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

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

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(1,11):
    w = r*x - d
    x=w
    print(w)

Solution (Python):
data = input().split(" ")
r = int(data[0])
D = int(data[1])
x2000 = int(data[2])


def xn(n,xn1):
	return r*xn1-D

x = x2000

for n in range(10):
	x = xn(n,x)
	print(x)

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

x = x2000
for i in range(10):
  print('{}'.format(x*r-D))
  x = x*r-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, x = map(int, raw_input().split())
for i in range(2001, 2011):
  print r*x - d
  x = r*x - d

Solution (Python):
def main():
    r, d, x = map(int, input().split())
    gram_list = [x]

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

    set(gram_list)
    for i in range(10):
        print(gram_list[i+1])

main()

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

Solution (Python):



r, D, x_2000 = map(int,input().split())
x = r * x_2000 - D
print(x)

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

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

for i in range(1, 11):
    x.append(x[i-1] * r - d)
    print(x[i])

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

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=[]
for j in range(10):
    x=r*x-D
    X.append(x)
for i in range(10):
    print(X[i])

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

x=[0]*11
for i in range(0,11,1):
    if i == 0:
        x[0] = x_2000
    elif i>0:
        x[i] =r*x[i-1] - D
        print(x[i])

Solution (Python):
a,b,c = map(int,input().split())
def fib(n):
  if n == 0:
    return c
  else:
    return a * fib(n-1) -b
  
for i in range(10):
  print(fib(i+1))

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

Solution (Python):
r,D,a=map(int,input().split())
mylist=[a]
for i in range(1,11):
    b = r*(mylist[i-1]) - D
    mylist.append(b)
for List in mylist[1:]:
  print(List)

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())

res = []
res.append(x)

for i in range(1,11):
    res.append(r * res[i-1] - D)

for p in range(1,len(res)):
    print(res[p])

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())
ans = []
num = x

for i in range(10):
    num = r * num - d
    ans.append(num)

for i in ans:
    print(i)

Solution (Python):
R_up, Down, First_number = map(int, input().split())
Tmp_number = First_number
for _ in range(10):
    Tmp_number = R_up*Tmp_number-Down
    print(Tmp_number)

Solution (Python):
from sys import stdin


r, D, x_2000 = [int(x) for x in stdin.readline().rstrip().split()]

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

for i in range(0,10):
    print(x[i])

Solution (Python):
a =list(map(int,input().split()))
r = a[0]
D = a[1]
x0= a[2]

def rec(x):
    return r*x - D

xi = x0

for i in range(10):
    print(rec(xi))
    xi = rec(xi)

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

for i in range(10):
    print(x_list[i+1])

Solution (Python):
a=input().split()
x=[None]*11
r,D,x[0]=int(a[0]),int(a[1]),int(a[2])
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 _ 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):
import numpy as np

N = input().split(" ")
r = int(N[0])
D = int(N[1])
x = int(N[2])
y = []
y.append(r*x-D)
for i in range(9):
    print(y[i])
    y.append(r*y[i]-D)
print(y[len(y)-1])

Solution (Python):
r,D,x=list(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)