#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, l, r;
  cin >> n >> l >> r;
  int min_arr[n], max_arr[n], min_sum = 0, max_sum = 0, pro = 1, j = 1, i;
  if (l == 1) min_sum = n;
  if (r == n) max_sum = pow(2, n) - 1;
  if (l > 1) {
    j = 2;
    for (i = l - 1; i > 0; i--) {
      min_sum = min_sum + j;
      j = j * 2;
    }
    min_sum = min_sum + n - l + 1;
  }
  if (r < n) {
    max_sum = pow(2, r - 1) - 1 + (n - r + 1) * pow(2, r - 1);
  }
  cout << min_sum << " " << max_sum;
}
