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.
import java.util.Scanner;

public class tennistournament {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		
		
		int n = sc.nextInt();
		int b = sc.nextInt();
		int p = sc.nextInt();
		
		int needb = 0;int needt = 0;
		
		int round = 0;
		
		int people = n;
		
		while (people > 1) {
//			if (people == 1) {
//				people = 0;
//				
//				break;
//			}
//			if(people == 2) {
//				people = 0;
//				round++;
//				break;
//			}
//			int temp = people;
//			people /= 2;
//			if (temp%2 != 0) people++;
//			round += temp / 2;
			
			int match = people / 2; int temp = people;
			needb += (match*((b*2)+1));
//			needt += (match*p);
			
			
			people /= 2;
			if (temp % 2 != 0) people++;
		}
//		System.out.println(round);
//		needb += (round*((b*2)+1));
		needt += (p*n);
		
		System.out.println(needb + " " + needt);
	}
	
	public static int fib(int n) {
		int[] arr = new int[n];
		arr[0] = 1;
		for (int i = 1; i < n; i++) {
			if (i == 1) {
				arr[1] = 1;
			}else {
//				System.out.println(i);
				arr[i] = arr[i-1]+arr[i-2];
			}
		}
		
		return arr[n-1];
	}

}
