#include <bits/stdc++.h>
int findMaximalK(int n);
using namespace std;
int main() {
  int n, b, p, x, y;
  cin >> n >> b >> p;
  y = n * p;
  x = 0;
  int remaining = n;
  while (remaining > 1) {
    int doingMatch = pow(2, findMaximalK(remaining));
    x += doingMatch * b + doingMatch / 2;
    int passToNextRound = remaining - doingMatch / 2;
    remaining = passToNextRound;
  }
  cout << x << " " << y;
}
int findMaximalK(int n) {
  int count = 0;
  while (n > 1) {
    n /= 2;
    count++;
  }
  return count;
}
