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



Sample input:
2 10 20


Sample output:
30
50
90
170
330
650
1290
2570
5130
10250

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(r: int, D: int, x: int):
    for _ in range(10):
        x = r * x - D
        print(x)
    return
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    r = int(next(tokens))  # type: int
    D = int(next(tokens))  # type: int
    x = int(next(tokens))  # type: int
    solve(r, D, x)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ret = []
for ii in range(10):
    x = r * x - D
    print(x)

Submission status: Accepted

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

Submission status: Accepted

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

def nextx(r, D, x):
  return r*x-D

for i in range(10):
  x=nextx(r, D, x)
  print(int(x))

Submission status: Accepted

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


def f(i, b):
    if i > 10:
        return

    y = r * b - D
    print(y)
    i += 1
    f(i, y)


f(1, x)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

# solve & output
tmp = x
for i in range(10):
    ans = r * tmp - D
    print(ans)
    tmp = ans

Submission status: Accepted

Solution code:
r, D, x = map(int, input().split())
tmp = x
for i in range(1,11):
    x1 = r * tmp - D
    print(x1)
    tmp = x1

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

lis=[x]
for i in range(10):
    a=lis[i]*r-d
    lis.append(a)

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

Submission status: Accepted

Solution code:
r = list(map(int,input().split()))

r0=r[0]
d0=r[1]
x0=r[2]
for i in range(10):
    x0 = r0*x0-d0
    print(x0)

Submission status: Accepted

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

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

print(*res, sep='\n')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def f(x, i):
    if i < 10:
        print(r * x - D)
        f(r * x - D, i + 1)
    else:
        exit

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

Submission status: Accepted

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

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

Submission status: Accepted

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

ans = x

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

Submission status: Accepted

Solution code:
r, d, x2000 = map(int, input().split())
prv_x = x2000
for i in range(2001, 2011):
  x = r*prv_x-d
  print(x)
  prv_x = x

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

def main(): 
    r,D,x_ini = map(int,input().split())
    x=x_ini
    for i in range(10):
        x = r*x-D
        print(x)            
if __name__ == "__main__":
    main()

Submission status: Accepted

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

y = []

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

print(*y, sep="\n")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
    r, D, x = map(int, input().split())
    ans = []
    for i in range(10):
        x = r*x - D
        print(x)
if __name__ == '__main__':
    # print(main())
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#B - Algae(ABC127)
r,D,x=list(map(int, input().split()))
for i in range(10):
    x=r*x-D
    print(x)

Submission status: Accepted

Solution code:
#coding:utf-8
r, d, x = map(int, input().split())

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

Submission status: Accepted

Solution code:
r, d, x = map(int, input().split())
ans = 0

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
r,D,x2000 = [int(i) for i in input().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)

Submission status: Accepted

Solution code:
r, D, x = map(int, input().split())
for i in range(10):
  if i==0:
    newx = r*x-D
    print(newx)
    a = newx
  else:
    newx = r*a-D
    print(newx)
    a = newx

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r, D, x2000 = [int(x) for x in input().split()]
for _ in range(10):
  x2000 = r * x2000 - D
  print(x2000)

Submission status: Accepted

Solution code:
from functools import lru_cache

r,d,x=map(int,input().split())
@lru_cache(maxsize=100)
def algae(n):
    if n==1:
        return x
    else:
        return r*algae(n-1)-d
for i in range(2,12):
    print(algae(i))

Submission status: Accepted

Solution code:
r,d,x=map(int,input().split())
def algae(n):
    if n==1:
        return x
    else:
        return r*algae(n-1)-d
for i in range(2,12):
    print(algae(i))

Submission status: Accepted

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

X = [0]*11
X[0] = x

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
r, D, xinit= map(int, input().split())

x = xinit

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r,d,x1 = map(int,input().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
r, d, x = map(int, input().split())
i = 10
while i > 0:
    x = r * x - d
    print(x)
    i -= 1

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
r, D, x = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math
import copy

class Score:
    def set_data(self, town, score, idx):
        self.town = set_town
        self.score = set_score
        self.idx = set_idx

inputa = input().split()
# inputb = input().split()

a = int(inputa[0])
b = int(inputa[1])
c = int(inputa[2])

# x = int(inputb[0])
# y = int(inputb[1])

# inputList=[]
# for i in range(a):
#     inputNum = input()
#     inputList.append(inputNum)

prev = c

for i in range(10):
    next = a * prev - b
    print(next)

    prev = next

Submission status: Accepted

Solution code:
r,d,s=map(int,input().split())

st=s
for i in range(10):
	res=st*r-d
	print(res)
	st=res

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
data=list(map(int,input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r,d,x = map(int,input().split())
cnt = [x]
for i in range(10):
  xx = r*cnt[0]-d
  print(xx)
  cnt.append(xx)
  cnt.pop(0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r, d, x = map(int, input().split())
ans = []

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

for j in ans:
    print(j)

Submission status: Accepted

Solution code:
r,d,x = map(int,input().split())
for _ in [0]*10:
  x = r*x-d
  print(x)

Submission status: Accepted

Solution code:
def solve():
    r, d, x2000 = list(map(int, input().split()))
    x2001_2010 = []
    now = x2000
    for i in range(1, 11):
        now = now * r - d
        x2001_2010.append(now)
    return "\n".join([str(i) for i in x2001_2010])


if __name__ == "__main__":
    print(solve())

Submission status: Accepted

Solution code:
a = []
a = input().split()

r = int(a[0])
D = int(a[1])
x = int(a[2])

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
r, D, xm = map(int, input().split())


p = xm
for i in range(10):
    n = r * p - D
    print(n)
    p = n

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inp = input().split()
r, d, x = int(inp[0]), int(inp[1]), int(inp[2])


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r,D,x=map(int,input().split())
c=1
while c<=10:
	x=r*x-D
	print(x)
	c=c+1

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r,D,x2k = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#ABC128 B
r, D, x_2000 = map(int, input().split())
x = x_2000
for i in range(10):
    x = r * x - D
    print(x)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
r, D, x = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
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])

Submission status: Accepted

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


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

Submission status: Accepted

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

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

    print(x)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import numpy as np

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

Solution code:
# ABC 127, B - algae
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])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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])

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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])

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
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


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

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

#C
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

#D
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

#E
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

#F
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

#G
def G():
    return

#H
def H():
    return

#I
def I_():
    return

#J
def J():
    return

#Solve
if __name__ == "__main__":
    B()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
r, d, x = map(int,input().split())
for i in range(10):
    x = r * x - d
    print(x)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#127
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])

Submission status: Accepted

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

Submission status: Accepted

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