A tennis tournament with *n* participants is running. The participants are playing by an olympic system, so the winners move on and the losers drop out.

The tournament takes place in the following way (below, *m* is the number of the participants of the current round):
 -  let *k* be the maximal power of the number 2 such that *k* ≤ *m*, -  *k* participants compete in the current round and a half of them passes to the next round, the other *m* - *k* participants pass to the next round directly, -  when only one participant remains, the tournament finishes. 
Each match requires *b* bottles of water for each participant and one bottle for the judge. Besides *p* towels are given to each participant for the whole tournament.

Find the number of bottles and towels needed for the tournament.

Note that it's a tennis tournament so in each match two participants compete (one of them will win and the other will lose).
The only line contains three integers *n*, *b*, *p* (1 ≤ *n*, *b*, *p* ≤ 500) — the number of participants and the parameters described in the problem statement.
In the first example will be three rounds:
 1.  in the first round will be two matches and for each match 5 bottles of water are needed (two for each of the participants and one for the judge), 1.  in the second round will be only one match, so we need another 5 bottles of water, 1.  in the third round will also be only one match, so we need another 5 bottles of water. 
So in total we need 20 bottles of water.

In the second example no participant will move on to some round directly.
5 2 3
20 15
8 2 4
35 32
10 1 500
27 5000
20 500 1
19019 20
100 123 99
24453 9900
500 1 1
1497 500
500 500 500
499499 250000
500 237 474
237025 237000
1 2 3
0 3
1 2 133
0 133
1 2 100
0 100
1 3 4
0 4
1 10 15
0 15
1 1 1
0 1
1 2 5
0 5
1 500 500
0 500
1 3 8
0 8
10 10 10
189 100
1 3 5
0 5
1 2 1
0 1
1 2 4
0 4
1 10 10
0 10
1 345 345
0 345
7 12 13
150 91
1 500 1
0 1
1 12 13
0 13
1 500 499
0 499
1 100 90
0 90
2 100 90
201 180
53 1 1
156 53
73 73 73
10584 5329
67 1 1
198 67
63 1 1
186 63
59 1 1
174 59
57 1 1
168 57
13 1 1
36 13
349 2 5
1740 1745
456 456 456
415415 207936
firstLine = list(map(int, input().split()))
n = firstLine[0]
b = firstLine[1]
p = firstLine[2]
numOfMatches = 1
numOfbottles = 0
numOftowels = 0
remaining = 0
numOftowels = n*p
while(numOfMatches*2 <= n):
    numOfMatches *= 2

if(numOfMatches == n):
    numOfMatches -= 1
else:
    remaining = n - numOfMatches
    numOfMatches = remaining + numOfMatches -1
numOfbottles = numOfMatches*2*b + numOfMatches

print(numOfbottles, numOftowels)
	  	   				  	 						 	 		    	