#include <bits/stdc++.h>
using namespace std;
int const INF = 2 * 10e5 + 123;
int simple(int n) {
  int i, sq;
  if (n % 2 == 0) {
    return 0;
  }
  sq = (int)sqrt(n);
  for (i = 3; i <= sq; i++) {
    if ((n % i) == 0) {
      return 0;
    }
  }
  return 1;
}
long long gcd(long long a, long long b) {
  if (a > b) swap(a, b);
  if (!a) return b;
  return gcd(b % a, a);
}
bool used[1000];
bool good[1000];
pair<int, int> a[1324];
int n, l, r;
void solve() {
  long long mx = 0, mn = 1e18;
  cin >> n >> l >> r;
  for (int i = l; i <= r; ++i) {
    long long tmp = 1, x = 1;
    for (int j = 2; j <= i; ++j) {
      x *= 2;
      tmp += x;
    }
    tmp += (n - i);
    mn = min(mn, tmp);
    tmp = 1, x = 1;
    for (int j = 2; j <= i; ++j) {
      x *= 2;
      tmp += x;
    }
    tmp += (n - i) * x;
    mx = max(mx, tmp);
  }
  cout << mn << " " << mx;
}
int main() {
  int T = 1;
  while (T--) {
    solve();
  }
}
