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 gcd(a_gcd, b_gcd):
#     while b_gcd != 0:
#         a_gcd, b_gcd = b_gcd, a_gcd % b_gcd
#     return a_gcd
#
#
# def lcm(a_lcm, b_lcm):
#     return a_lcm * b // gcd(a_lcm, b_lcm)
#
#
# def max_sum(N_max_sum, a_max_sum):
#     dp = [0] * (N_max_sum + 1)
#     for i in range(N_max_sum):
#         dp[i + 1] = max(dp[i], dp[i] + a_max_sum[i])
#     return dp[N]
#
#
# def knapsack(N_knapsack, W, weight, value):
#     inf = float("inf")
#     dp = [[-inf for _ in range(W+1)] for j in range(N_knapsack + 1)]
#     for i in range(W+1):
#         dp[0][i] = 0
#
#     for i in range(N_knapsack):
#         for w in range(W+1):
#             if weight[i] <= w:
#                 dp[i+1][w] = max(dp[i][w-weight[i]]+value[i], dp[i][w])
#             else:
#                 dp[i+1][w] = dp[i][w]
#     return dp[N_knapsack][W]
#
#
# class UnionFind:
#     def __init__(self, n):
#         self.par = [i for i in range(n+1)]
#         self.rank = [0] * (n+1)
#
#     # 検索
#     def find(self, x):
#         if self.par[x] == x:
#             return x
#         else:
#             self.par[x] = self.find(self.par[x])
#             return self.par[x]
#
#     # 併合
#     def union(self, x, y):
#         x = self.find(x)
#         y = self.find(y)
#         if self.rank[x] < self.rank[y]:
#             self.par[x] = y
#         else:
#             self.par[y] = x
#             if self.rank[x] == self.rank[y]:
#                 self.rank[x] += 1
#
#     # 同じ集合に属するか判定
#     def same_check(self, x, y):
#         return self.find(x) == self.find(y)
#
# S = input()
# N = int(input())
# A = list(map(int, input().split()))
# X = [int(input()) for _ in range(N)]

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

Submission status: Accepted

Solution code:
r, d, x = map(int, input().split())
b = x
for i in range(10):
    b = r * b - d
    print(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:
#!/usr/bin/env python3

import math

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
input = sys.stdin.readline
 
# bisect_left(lists, 3)
# bisect_right(lists, 3)
 
def main():
	r, D, x2000 = map(int, input().split(" "))
	#N = int(input())
	#S = input()

	ans = []
	for i in range(10):
		if i == 0:
			tmp = r * x2000 - D
			ans.append(tmp)
		else:
			tmp = r * ans[i-1] - D
			ans.append(tmp)
	
	for i in ans:
		print(i)


if __name__ == "__main__":
	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 = (int(x) for x in 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:
r, D, x = list(map(int,input().split()))

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

Submission status: Accepted

Solution code:
r, d, x0 = [int(i) for i in input().split(" ")]
x = [0] * 11
x[0] = x0

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

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

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

Submission status: Accepted

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

before = init
for year in range(10):
    before = int(r*before-D)
    print(before)

Submission status: Accepted

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

Submission status: Accepted

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

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:
from sys import stdin
data = stdin.readline().split()
r,D,x = int(data[0]), int(data[1]), int(data[2])
for itr 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:
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
input=sys.stdin.readline

input=sys.stdin.readline
r,D,x2000 = map(int,input().split())
x = r*x2000-D
print(x)
for i in range(9):
  x = r*x-D
  print(x)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

x = x2000
for _ in range(10):
    x = r * x - D
    if x < 0:
        x = 0
    print(x)

Submission status: Accepted

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

xi = []

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

for x in xi:
    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 = 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 -*-
"""
Created on Sat Apr 20 20:47:47 2019

@author: Owner
"""

# -*- coding: utf-8 -*-
"""
Created on Sat Apr 13 09:53:12 2019

@author: Owner
"""
import numpy as np
import sys
import collections
import scipy.misc
import math
from operator import itemgetter
import itertools
import copy
import bisect

#素因数を並べる
def prime_decomposition(n):
  i = 2
  table = []
  while i * i <= n:
    while n % i == 0:
      n /= i
      table.append(int(i))
    i += 1
  if n > 1:
    table.append(int(n))
  return table   
# 桁数を吐く
def digit(i):
    if i > 0:
        return digit(i//10) + [i%10]
    else:
        return []
    
def getNearestValueIndex(list, num):
    """
    概要: リストからある値に最も近い値のインデックスを取得する関数
    @param list: データ配列
    @param num: 対象値
    @return 対象値に最も近い値
    """

    # リスト要素と対象値の差分を計算し最小値のインデックスを取得
    idx = np.abs(np.asarray(list) - num).argmin()
    return idx

def find_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default

class UnionFind(object):
    def __init__(self, n=1):
        self.par = [i for i in range(n)]
        self.rank = [0 for _ in range(n)]
        self.size = [1 for _ in range(n)]

    def find(self, x):
        """
        x が属するグループを探索
        """
        if self.par[x] == x:
            return x
        else:
            self.par[x] = self.find(self.par[x])
            return self.par[x]

    def union(self, x, y):
        """
        x と y のグループを結合
        """
        x = self.find(x)
        y = self.find(y)
        if x != y:
            if self.rank[x] < self.rank[y]:
                x, y = y, x
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1
            self.par[y] = x
            self.size[x] += self.size[y]

    def is_same(self, x, y):
        """
        x と y が同じグループか否か
        """
        return self.find(x) == self.find(y)

    def get_size(self, x):
        """
        x が属するグループの要素数
        """
        x = self.find(x)
        return self.size[x]
    

"""
N, X = map(int, input().split())

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

P = [0]*N
Y = [0]*N
for n in range(N):
    P[n], Y[n] = map(int, input().split())

# 多次元配列の宣言（あとでintにすること。）（タプルにすること。）
dp = np.zeros((N+1, 4,4,4))
    
all(nstr.count(c) for c in '753')

# 複数配列を並び替え
ABT = zip(A, B, totAB)
result = 0
# itemgetterには何番目の配列をキーにしたいか渡します
sorted(ABT,key=itemgetter(2))
A, B, totAB = zip(*ABT)
A.sort(reverse=True)

# 2進数のbit判定
(x >> i) & 1

# dp最小化問題
dp = [np.inf]*N
for n in range(N):
    if n == 0:
        dp[n] = 0
    else:
        for k in range(1,K+1):
            if n-k >= 0:
                dp[n] = min(dp[n], dp[n-k] + abs(h[n]-h[n-k]))
            else:
                break
# 累積和
add = 1 # 問題によって決まる
res = 0
sums = [0]*(len(nums)+1)
for i in range(len(nums)):
    sums[i+1] = sums[i] + nums[i]
for i in range(0, len(nums), 2):
    left = i
    right = min(i+add, len(nums))
    tmp = sums[right] - sums[left]
    res = max(tmp, res)

#２分探索
li, ri = bisect.bisect_left(p_ac, l[i]-1), bisect.bisect_right(p_ac, r[i]-1)    

#ソート関数
org_list = [3, 1, 4, 5, 2]
new_list = sorted(org_list)
print(org_list)
print(new_list)
# [3, 1, 4, 5, 2]
# [1, 2, 3, 4, 5]

#Distance Transformation
    for h in range(0,H):
        for w in range(0,W):
            if h == 0 and w == 0:
                pass
            elif h == 0:
                D[H-h-1][W-w-1]= min(D[H-h-1][W-w-1], D[H-h-1][W-w]+1)
            elif w == 0:   
                D[H-h-1][W-w-1]= min(D[H-h-1][W-w-1], D[H-h][W-w-1]+1)
            else:
                D[H-h-1][W-w-1]= min(D[H-h-1][W-w-1], D[H-h][W-w-1]+1, D[H-h-1][W-w]+1, D[H-h][W-w]+2)
            d_max = max(D[H-h-1][W-w-1], d_max)

"""


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

    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys,heapq
from collections import deque,defaultdict
printn = lambda x: sys.stdout.write(x)
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
DBG = True # and False
def ddprint(x):
  if DBG:
    print(x)

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

Submission status: Accepted

Solution code:
# 2019/05/25
# AtCoder Beginner Contest 126 - B

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

# Calc
for i in range(10):
    nx = r * wx - d
    wx = nx
    # Output
    print(nx)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
# sys.stdin.readline()
import sys
input = sys.stdin.readline

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

Submission status: Accepted

Solution code:
r,D,x=(int(x) for x in input().split())
for a 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())
N = 10

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

Submission status: Accepted

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

for i in range(10):
    y = r*xx
    xxx = y - D
    print(xxx)
    xx = xxx

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys,collections,math,random;sys.setrecursionlimit(10**7)
def Is(): return [int(x) for x in sys.stdin.readline().split()]
def Ss(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
l = list(map(int,input().split()))
r=l[0]
d=l[1]
x=l[2]
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().strip().split(' ')]

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat May 25 20:54:40 2019

@author: USER
"""

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

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

Submission status: Accepted

Solution code:
#入力取得
r, D, x_n = map(int, input().split())


def next(x_n):
    return r*x_n -D


for i in range(10):
    x_n = next(x_n)
    print(x_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,x = map(int,input().split())

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

Submission status: Accepted

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

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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


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


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

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

xi = x2000


for _ in range(2001, 2010+1):
    xi = r * xi - D
    print(xi)

Submission status: Accepted

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

Submission status: Accepted

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



# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    # Failed to predict input format
    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):
    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, tmp_x = map(int,input().split())

for i in range(10):
	tmp_x = r * tmp_x - D
	print(tmp_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:
#!/usr/bin/env python
"""<https://github.com/cheran-senthil/PyRival>"""
from __future__ import division, print_function

import os
import sys
from io import BytesIO, IOBase

if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip
else:
    _str = str
    str = lambda x=b"": x if type(x) is bytes else _str(x).encode()


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

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


# region fastio

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        if self.buffer.tell():
            return self.buffer.read()
        return os.read(self._fd, os.fstat(self._fd).st_size)

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", b" "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", b"\n"))
    if kwargs.pop("flush", False):
        file.flush()


sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
input = lambda: sys.stdin.readline().rstrip(b"\r\n")

# endregion

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
x = []
r, d, i = [int(i) for i in input().split()]
x.append(i)
for i in range(0, 10):
    x.append(0)
    x[i+1] = 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):
    if i == 0:
        a = r * x - d
    else:
        a = r * a - d
    print(a)

Submission status: Accepted

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

x_2001 = r * x_2000 - D
x_2002 = r * x_2001 - D
x_2003 = r * x_2002 - D
x_2004 = r * x_2003 - D
x_2005 = r * x_2004 - D
x_2006 = r * x_2005 - D
x_2007 = r * x_2006 - D
x_2008 = r * x_2007 - D
x_2009 = r * x_2008 - D
x_2010 = r * x_2009 - D

print(x_2001)
print(x_2002)
print(x_2003)
print(x_2004)
print(x_2005)
print(x_2006)
print(x_2007)
print(x_2008)
print(x_2009)
print(x_2010)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

x = [0] * 11
x[0] = x_0

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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:
import math

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 = (int(i) for i in input().split())
for i in range(10):
    temp = r * x - D
    print(temp)
    x = temp

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat May 25 20:54:15 2019

@author: Yamazaki Kenichi
"""

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

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

for i in range(10):
    x = a(x,D)
    print(x)

Submission status: Accepted

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

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

x = x2000
for i in range(1, 10+1):
    x = r * x - d
    print(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:
#a, b, c, d = (int(i) for i in input().split())  

#a = [int(i) for i in input().split()] 

r, D, x_past = (int(i) for i in input().split())  

for i in range(10):
    x_next = r*x_past -D
    print(x_next)
    x_past = x_next
    
# if A <= 5:
#     print(0)
# elif 5 < A and A <= 12:
#     print(int(B/2))
# else:
#     print(B)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r, D, x = [int(n) for n in 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):
	a=(r*x)-D
	print(a)
	x=a

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
def solve(): 
    r, D, x =  map(int, input().split())
    res_l = []
    for _ in range(10):
        x = r*x - D
        res_l.append(str(x))
    
    return '\n'.join(res_l)

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

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

Submission status: Accepted

Solution code:
inpl = lambda: list(map(int,input().split()))
r, D, x = inpl()
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 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,twokx = map(int,input().split())
x=twokx

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

Submission status: Accepted

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

num = X

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

Submission status: Accepted

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

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

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

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

Submission status: Accepted

Solution code:
def f(r,x,D):
    return r*x - D

r,D,x = (int(i) for i in input().split())

for i in range(10):
    x = f(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, raw_input().strip().split())

for i in xrange(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, x2000 = map(int, input().split())

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

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline

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

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

Submission status: Accepted

Solution code:
def solve():
    r, D, x2000 = [int(_) for _ in raw_input().split()]
    ret = x2000
    for i in range(10):
        ret = r * ret - D
        print ret

if __name__ == '__main__':
    solve()

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

res.sort()
for x in res:
    print(x)

Submission status: Accepted

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

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

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)
for i in range(10):
    print(x[i+1])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
r, d, x_i = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
from functools import reduce
from collections import deque

def s(generator, splitter, mapper):
    return [ mapper(s) for s in generator().split(splitter) ]

# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
    return [ int(s) for s in input().split(" ")]

# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
    return [ int(input()) for _ in range(n)]

r,d,x_2000 = get_nums_l()

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

Submission status: Accepted

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

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