#include <bits/stdc++.h>
using namespace std;
vector<long long> v;
void prime(long long n) {
  for (long long i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      if (i * i == n) {
        v.push_back(i);
      } else {
        v.push_back(i);
        v.push_back(n / i);
      }
    }
  }
}
int main() {
  int n, l, r;
  scanf("%d %d %d", &n, &l, &r);
  int ans_min = 0, ans_max = 0, c = 1;
  ans_min = (1 - pow(2, l)) / (1 - 2) + (n - l);
  ans_max = (1 - pow(2, r)) / (1 - 2) + pow(2, r - 1) * (n - r);
  printf("%d %d\n", ans_min, ans_max);
}
