#include <bits/stdc++.h>
using namespace std;
long long int a[200003];
int n;
long long int cache1[200003];
long long int cache2[200003];
long long int dpn(int);
long long int dp(int i) {
  if (cache1[i] != -1) {
    return cache1[i];
  }
  if (i == n - 1) {
    if (a[i] > 0) {
      return cache1[i] = 1;
    } else {
      return cache1[i] = 0;
    }
  } else {
    if (a[i] > 0) {
      return cache1[i] = dp(i + 1) + 1;
    } else {
      return cache1[i] = dpn(i + 1);
    }
  }
}
long long int dpn(int i) {
  if (cache2[i] != -1) {
    return cache2[i];
  }
  if (i == n - 1) {
    if (a[i] > 0) {
      return cache2[i] = 0;
    } else {
      return cache2[i] = 1;
    }
  } else {
    if (a[i] > 0) {
      return cache2[i] = dpn(i + 1);
    } else {
      return cache2[i] = 1 + dp(i + 1);
    }
  }
}
int main(int argc, char const *argv[]) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n, l, r;
  cin >> n >> l >> r;
  long long int ans = n - (l - 1);
  for (int i = 0; i < l - 1; i++) {
    ans += 1 << (i + 1);
  }
  cout << ans << " ";
  ans = (n - r + 1) * (1 << (r - 1));
  for (int i = 0; i < r - 1; i++) {
    ans += 1 << (i);
  }
  cout << ans << "\n";
  return 0;
}
