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

r, D, x = MAP()

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

r, D, x = MAP()

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