#!/usr/bin/env python
from collections import deque, defaultdict
from itertools import combinations, combinations_with_replacement
import bisect
from math import factorial, sqrt, log, ceil, floor

def main():
    #N, M = map(int, input().split())
    r, D, x = map(int, input().split())

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


if __name__ == '__main__':
    main() from collections import deque, defaultdict from itertools import combinations, combinations_with_replacement import bisect bisect from math import factorial, sqrt, log, ceil, floor def main():
    #N, M = map(int, input().split())
    r, D, x = map(int, input().split())

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

    for i in range(10):
        x = r * x - D
        print(x) def main():
    #N, M = map(int, input().split())
    r, D, x = map(int, input().split())

    for i in range(10):
        x = r * x - D
        print(x) main
#!/usr/bin/env python
from collections import deque, defaultdict
from itertools import combinations, combinations_with_replacement
import bisect
from math import factorial, sqrt, log, ceil, floor

def main():
    #N, M = map(int, input().split())
    r, D, x = map(int, input().split())

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


if __name__ == '__main__':
    main()
