#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, ll, rr, num = 0LL, cnt = 0LL, rest = 0LL, ans = 0LL,
                       ans_mx = 0LL, ans_mn = 1e12;
  scanf("%lld%lld%lld", &n, &ll, &rr);
  for (long long l = ll; l <= rr; ++l) {
    num = pow(2LL, (l - 1LL));
    cnt = n - l + 1LL;
    rest = l - 1LL;
    ans = 0LL;
    ans += (num * cnt);
    while (rest--) {
      num /= 2LL;
      ans += num;
    }
    ans_mx = max(ans_mx, ans);
  }
  for (long long l = ll; l <= rr; ++l) {
    num = 1LL;
    cnt = n - l + 1LL;
    rest = l - 1LL;
    ans = 0LL;
    ans += (1LL * num * cnt);
    while (rest--) {
      num *= 2LL;
      ans += num;
    }
    ans_mn = min(ans_mn, ans);
  }
  printf("%lld %lld", ans_mn, ans_mx);
  return 0;
}
