#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, l, r;
  cin >> n >> l >> r;
  long long min_ans = -1, max_ans = -1;
  for (int k = l; k <= r; k++) {
    int s = n - (k - 1);
    for (int i = 2; i <= k; i++) {
      s += (1LL << (i - 1));
    }
    if (min_ans == -1 || s < min_ans) min_ans = s;
  }
  for (int k = l; k <= r; k++) {
    int s = 0;
    for (int i = 1; i <= k; i++) {
      s += (1LL << (i - 1));
    }
    s += (1LL << (k - 1)) * (long long)(n - k);
    if (max_ans == -1 || s > max_ans) max_ans = s;
  }
  cout << min_ans << " " << max_ans << endl;
  return 0;
}
