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

Input

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.

Output

Print two integers x and y — the number of bottles and towels need for the tournament.

Examples

Input

5 2 3


Output

20 15


Input

8 2 4


Output

35 32

Note

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), 
  2. in the second round will be only one match, so we need another 5 bottles of water, 
  3. 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.
#Justin Hershberger
#Py3.5

import fileinput

def test():
	pass
if __name__ == '__main__':
	num_args = 1
	for arg in range(num_args):
		n,b,p = map(int, input().split())

	#m is the number of participants of the current round
	m = n

	#initially we have n / 2 matches since there are n participants
	num_matches = m // 2

	#the remainder is the number of extras
	extras = abs(-m // 2) - num_matches

	#initially our running total will be num matches * 3
	sum_b = (num_matches * 2 * b) + (num_matches)

	#we have n participants so we initially need n * p towels
	sum_p = n * p

	# print("nm: ", num_matches, " ex: ", extras, " sum_b: ", sum_b, " sum_p: ", sum_p);
	# print(m)
	#each match needs b bottles * 3, each player needs p towels
	while num_matches > 0:
		#update the number of participants and num_bottles
		m = num_matches + extras
		# print("m: ", m)
		#update the number of matches
		num_matches = m // 2
		# print("nm: ", num_matches)
		extras = abs(-m // 2) - num_matches
		# print("ex: ", extras)

		#each match has two participants and one judge who gets one bottle
		sum_b += (num_matches * 2 * b) + (num_matches)

	print(sum_b, sum_p)
