Mislove Has Lost an Array

Mislove had an array a1, a2, ⋯, an of n positive integers, but he has lost it. He only remembers the following facts about it:

The number of different numbers in the array is not less than l and is not greater than r;
For each array's element ai either ai=1 or ai is even and there is a number ai2 in the array.

For example, if n=5, l=2, r=3 then an array could be [1,2,2,4,4] or [1,1,1,1,2]; but it couldn't be [1,2,2,4,8] because this array contains 4 different numbers; it couldn't be [1,2,2,3,3] because 3 is odd and isn't equal to 1; and it couldn't be [1,1,2,2,16] because there is a number 16 in the array but there isn't a number 162=8.

According to these facts, he is asking you to count the minimal and the maximal possible sums of all elements in an array.

Input

The only input line contains three integers n, l and r (1≤n≤1000, 1≤l≤r≤min(n,20)) — an array's size, the minimal number and the maximal number of distinct elements in an array.

Output

Output two numbers — the minimal and the maximal possible sums of all elements in an array.

Examples

Input

4 2 2

Output

5 7

Input

5 1 5

Output

5 31

Solution

#include <bits/stdc++.h>

using namespace std;

int main() {

int n, l, r;

cin >> n >> l >> r;

int mns = (1 << l) - 1 + (n - l);

int mxs = (1 << r) - 1 + (n - r) * (1 << r >> 1);

cout << mns << " " << mxs << endl;

return 0;

}

Comments