tom-and-coins

Problem Statement:

Tom is collecting money for his birthday party, he is having 'a' coins today and his father gives him 'k' coins each day. 

Since his birthday is on 'nth' day, he wants to know the amount of money he will have on his birthday.

Tom is weak at maths, help him calculate the number of coins he will have on his birthday.

Input:

The first line of input contains an integer 'T' denoting the number of test cases.
Each line of test case contains 3 space seperated integers 'a', 'k', 'n' .

Output:

For each test case, output the number of coins Tom will have on his birthday.

Constraints:

1 ≤ T ≤ 100

1 ≤ a,n ≤ 100

0 ≤ k ≤ 100

SAMPLE INPUT
3
2 2 3
1 2 3
1 0 3

SAMPLE OUTPUT
6
5
1

Explanation

In test case 1, a=2, k=2 and n=3. since today he has 2 coins and his father gives him 2 coins each day, on the 3rd day he will have 2+2+2=6 coins

Source: hackerearth | Difficulty: EASY


Solutions:
for T in range(int(input())):
	a,k,n = list(map(int,input().split()))
	for i in range(1,n):
		a= a + k
	print(a)


T=eval(input())

for i in range(T):
	s=0
	a,d,n=list(map(int,input().split()))
	n=n-1
	s=a+d*n
	print(s)



for T in range(int(input())):
	a,k,n = list(map(int,input().split()))
	for i in range(1,n):
		a= a + k
	print(a)


for _ in range(eval(input())):
	a,k,n=list(map(int,input().split()))
	print(a+k*(n-1))


t=eval(input())
while t>0:
	t=t-1
	a,b,c=list(map(int,input().split()))
	print(a+b*(c-1))


t=int(input())
for i in range(t):
	m=input()
	n=m.split(' ')
	c= int( n[0])+(int(n[1])*(int(n[2])-1))
	print(c)


t=eval(input())
while t:
	t=t-1
	a,k,n=list(map(int,input().split()))
	total=a+(n-1)*k
	print(total)
	
	


t=eval(input())
while t:
	t=t-1
	a,k,n=list(map(int,input().split()))
	total=a+(n-1)*k
	print(total)
	
	


for i in range (eval(input())):
	a,b,c=list(map(int,input().strip().split()))
	print(a+b*(c-1))


t=int(input())
while t:
	a,k,n=list(map(int,input().split()))
	print(a+k*(n-1))
	t-=1