#include <bits/stdc++.h>
using namespace std;
const long long INF = 2e15;
long long ansMin = 0LL, ansMax = 0LL;
long long qwe(long long x, long long y) {
  long long ans = 1LL;
  while (y) {
    if (y & 1) ans = ans * x;
    x = x * x;
    y >>= 1;
  }
  return ans;
}
int main() {
  int n, l, r;
  scanf("%d %d %d", &n, &l, &r);
  for (int i = 1; i <= l; i++) {
    long long res = qwe(2LL, (long long)(i - 1));
    ansMin += res;
  }
  for (int i = 1; i <= r; i++) {
    long long res = qwe(2LL, (long long)(i - 1));
    ansMax += res;
  }
  int resMin = n - l;
  ansMin += (long long)(n - l) * 1LL;
  int resMax = n - r;
  ansMax += (long long)(n - r) * qwe(2LL, (long long)(r - 1));
  printf("%lld %lld\n", ansMin, ansMax);
  return 0;
}
