#include <bits/stdc++.h>
using namespace std;
long long bigmod(long long b, long long p, long long md) {
  if (p == 0) return 1;
  if (p % 2 == 1) {
    return ((b % md) * bigmod(b, p - 1, md)) % md;
  } else {
    long long y = bigmod(b, p / 2, md);
    return (y * y) % md;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(nullptr);
  ;
  long long n, l, r;
  cin >> n >> l >> r;
  long long mn = 1;
  long long c = 1;
  for (long long i = 2; i <= min(n, l); i++) {
    c = c * 2;
    mn += c;
  }
  if (l < n) mn += n - l;
  long long mx = 1;
  c = 1;
  for (long long i = 2; i <= min(n, r); i++) {
    c = c * 2;
    mx += c;
  }
  if (r < n) mx += (n - r) * c;
  cout << mn << " " << mx << endl;
  return 0;
}
