#include <bits/stdc++.h>
using namespace std;
const int maxN = (int)1e5 + 123;
const int MOD = (int)1e9 + 7;
void solve() {
  int n, l, r;
  cin >> n >> l >> r;
  long long mn = n - l + 1;
  long long mx = 1;
  long long mx2 = 0;
  for (int i = 1; i < l; i++) {
    mn += 1 << i;
  }
  for (int i = 1; i < r; i++) {
    mx += 1 << i;
  }
  int carry = (1 << (r - 1));
  mx2 += mx;
  for (int i = r; i < n; i++) {
    mx2 += carry;
  }
  cout << mn << " " << mx2 << endl;
}
int main() {
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
