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

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

def function(y):
    y = r * y - D

    return y

z = 1
while z <= 10:
    z += 1
    ans = function(x)
    x = function(x)
    print(ans)

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

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

Submission status: Accepted

Solution code:
r, D, x = map(int, input().split())
def f(r, D, x):
  return r * x - D

for i 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(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(1,11):
    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())
for i in range(10):
    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 = x * r - D
    print(x)

Submission status: Accepted

Solution code:
[r,D,x]=[int(_) for _ in input().split()]
for i in [0]*10:
  print(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:
import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())


r,D,x = MI()
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):
  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 = r*ans-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:
r,d,x=map(int,input().split())
for alg 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 _ 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):
    x = r*x - D
    print(x)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

while cnt < 10:
    x = r*x-d
    print(x)
    cnt += 1

Submission status: Accepted

Solution code:
# B Algea
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):
    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, s = map(int, input().split())

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

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

Submission status: Accepted

Solution code:
def mapt(fn, *args):
    return tuple(map(fn, *args))


def Input():
    return mapt(int, input().split(" "))


def main():
    r, d, x = Input()
    for _ in range(10):
        x = x * r - d
        print(x)

main()

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

c=0
while c<10:
    x=r*x-D
    print(x)
    c+=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_2000 = map(int, input().split())

x = [x_2000] * 11

for i in range(10):
  x[i+1] = r * x[i] - D
  
print(*x[1:], 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:
def main():
    r, D, x = map(int, input().split())
    lst = [0] * 11
    lst[0] = x

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

X = []
X.append(x)

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

r,d,x=mp()
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:
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=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_2000 = map(int,input().split())

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

Submission status: Accepted

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

ans=x

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r,d,x=map(int,input().split())
ans=0
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 = r*x - d
  print(x)

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())
koke=[0]*11
koke[0]=x
for i in range(10):
    koke[i+1]=r*koke[i]-d
for i in range (10):
    print(koke[i+1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**9)

def mi(): return map(int,input().split())
def ii(): return int(input())
def isp(): return input().split()
def deb(text): print("-------\n{}\n-------".format(text))

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




if __name__ == "__main__":
    main()

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#! python3
#  solve127B.py

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

Submission status: Accepted

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

T = 0
while T < 10:
  x = r * x - D
  print(x)
  T += 1

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r, D, x = list(map(lambda a: int(a), input().split(" ")))
 
ans = []
for i in range(10):
  x = r * x - D
  ans.append(str(x))
 
print("\n".join(ans))

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())
[print(int(r**i*(x+d/(1-r))-d/(1-r))) for i in range(1,11)]

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())
# x2001からx2010まで表示する。
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(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 = 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:
import sys

stdin = sys.stdin
def ns(): return stdin.readline().rstrip()
def ni(): return int(stdin.readline().rstrip())
def nm(): return map(int, stdin.readline().split())
def nl(): return list(map(int, stdin.readline().split()))


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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

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

Submission status: Accepted

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
MM = input().split()
r = int(MM[0])
D = int(MM[1])
x = int(MM[2])
for i in range(10):
  a = r*x -D
  print(a)
  x = a

Submission status: Accepted

Solution code:
r, d ,x =map(int, input().split())
a = [0] * 11
a[0] = x

for i in range(1, 11):
    a[i] = r * a[i - 1] - d
    print(a[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())
L=[]
for i in range(10):
  x = r*x - d
  L.append(x)
for j in range(10):
  print(L[j])

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r,d,x=map(int,input().split());a=[0 for i in range(10)];a[0]=r*x-d;
for i in range(1,10): a[i]=r*a[i-1]-d
print('\n'.join(map(str,a)))

Submission status: Accepted

Solution code:
import sys

def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())

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

Submission status: Accepted

Solution code:
r,d,x = map(int,input().split())
for i in range(1,11):
    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:
# -*- coding: utf-8 -*-

def main():

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

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

    for i in ans:
        print(i)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# abc127_b.py
# https://atcoder.jp/contests/abc127/tasks/abc127_b

# B - Algae /
# 実行時間制限: 2 sec / メモリ制限: 1024 MB
# 配点 : 200点

# 問題文
# ある池に生えている藻類は、以下のように成長します。
# 西暦 i年になる瞬間に生えている重さの合計を xi グラムとすると、 i≥2000に対して、以下の式が成り立ちます:
#     xi+1=rxi−D
#     r, D, x2000 が与えられます。x2001, ..., x2010を計算し、順に出力してください。

# 制約
#     2≤r≤5
#     1≤D≤100
#     D<x2000≤200
#     入力はすべて整数

# 入力
# 入力は以下の形式で標準入力から与えられる。
# r D x2000

# 出力
# 10行出力せよ。i 行目 (1≤i≤10) には x2000+iを整数で出力せよ。

# 入力例 1
# 2 10 20

# 出力例 1
# 30
# 50
# 90
# 170
# 330
# 650
# 1290
# 2570
# 5130
# 10250

# 例えば、x2001=rx2000−D=2×20−10=30、 x2002=rx2001−D=2×30−10=50です。

# 入力例 2
# 4 40 60

# 出力例 2
# 200
# 760
# 3000
# 11960
# 47800
# 191160
# 764600
# 3058360
# 12233400
# 48933560


global FLAG_LOG
FLAG_LOG = False


def log(value):
    # FLAG_LOG = True
    # FLAG_LOG = False
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    # S = lines[0]
    # N = int(lines[0])
    r, D, x = list(map(int, lines[0].split()))
    # values = list(map(int, lines[1].split()))
    # values = list(map(int, lines[2].split()))
    # values = list()
    # for i in range(6):
    #     values.append(int(lines[i]))
    # valueses = list()
    # for i in range(Q):
    #     valueses.append(list(map(int, lines[i+1].split())))

    results = list()

    for i in range(10):
        result = r * x - D
        results.append(result)
        x = result

    return results


# 引数を取得
def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['2 10 20']
        lines_export = [30, 50, 90, 170, 330, 650, 1290, 2570, 5130, 10250]
    if pattern == 2:
        lines_input = ['4 40 60']
        lines_export = [200, 760, 3000, 11960, 47800, 191160, 764600, 3058360, 12233400, 48933560]
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode


# 主処理
def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    # if mode > 0:
    #     print(f'lines_input=[{lines_input}]')
    #     print(f'lines_export=[{lines_export}]')
    #     print(f'lines_result=[{lines_result}]')
    #     if lines_result == lines_export:
    #         print('OK')
    #     else:
    #         print('NG')
    # finished = time.time()
    # duration = finished - started
    # print(f'duration=[{duration}]')


# 起動処理
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:
import sys
import math


def input():
    return sys.stdin.readline().rstrip()


def main():
    r, D, x = map(int, input().split())
    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())

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

Submission status: Accepted

Solution code:
r,d,l = (int(xi) for xi in input().split())


for xi in range(10):
    l = r*l-d
    print(l)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
    r, D, x = map(int, input().split())
    t = x
    for i in range(10):
        t = (r*t)-D
        print(t)
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())
res = x
for i in range(10):
  res = r*res - D
  print(res)

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

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:
a = list(map(int, input().split()))
d = 1
c = a[2]
while d <= 10:
  c = a[0]*c-a[1]
  print(c)
  d += 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, x2000 = map(int,input().split())

lst = [x2000]

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

Submission status: Accepted

Solution code:
import sys, math
from collections import defaultdict, deque, Counter
from bisect import bisect_left, bisect_right
from itertools import combinations, permutations, product
from heapq import heappush, heappop
from functools import lru_cache
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 1000000007
sys.setrecursionlimit(1000000)

r, D, x = rl()

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

Submission status: Accepted

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

def x_pro(x):
    return r*x-d

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

Submission status: Accepted

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

for i in range(0,10):
    ans=a*c-b
    print(ans)
    c=ans

Submission status: Accepted

Solution code:
#入力:N,M(int:整数)
def input2():
	return map(int,input().split())
  
r,D,x=input2()

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

Submission status: Accepted

Solution code:
def resolve():
    #n=int(input())
    #a,b=map(int,input().split())
    #x=list(map(int,input().split()))
    #a=[list(map(lambda x:int(x)%2,input().split())) for _ in range(h)]
    r,d,x=map(int,input().split())
    for i in range(10):
        x=r*x-d
        print(x)
    
    
if __name__ == '__main__':
    resolve()

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, x0 = map(int, input().split())
x = [x0]
for i in range(10):
    x.append(r*x[-1] - d)
print(*x[1:], sep='\n')

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:
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):
    y = r * x - D 
    print(y)
    x = 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:
a = input().split()
r = int(a[0])
D = int(a[1])
x = int(a[2])
for i in range(10):
    if i == 0:
        xx = r * x - D
    else:
        xx = r * xx -D
    print(xx)

Submission status: Accepted

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

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

Submission status: Accepted

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

if not ( 2 <= r <= 5 ): sys.exit()
if not ( 1 <= D <= 100 ): sys.exit()
if not ( D < x <= 200 ): sys.exit()

before_x = x
for I in range(10):
    print( r * before_x - D)
    before_x = r * before_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, x = map(int, input().split())
for i in range(1, 11):
    print(x := r * x - d)

Submission status: Accepted

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

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

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:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def s(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

r,d,x = I()
for i in range(10):
    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 = r*ans-D
  print(int(ans))

Submission status: Accepted

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

x1 = r*x0 - D
x2 = r*x1 - D
x3 = r*x2 - D
x4 = r*x3 - D
x5 = r*x4 - D
x6 = r*x5 - D
x7 = r*x6 - D
x8 = r*x7 - D
x9 = r*x8 - D
x10 = r*x9 - D

print(x1)
print(x2)
print(x3)
print(x4)
print(x5)
print(x6)
print(x7)
print(x8)
print(x9)
print(x10)

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())
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(1, 10+1):
    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)