A tennis tournament with n participants is running. The participants are playing by an olympic system, so the winners move on and the losers drop out.

The tournament takes place in the following way (below, m is the number of the participants of the current round):

  * let k be the maximal power of the number 2 such that k ≤ m, 
  * k participants compete in the current round and a half of them passes to the next round, the other m - k participants pass to the next round directly, 
  * when only one participant remains, the tournament finishes. 



Each match requires b bottles of water for each participant and one bottle for the judge. Besides p towels are given to each participant for the whole tournament.

Find the number of bottles and towels needed for the tournament.

Note that it's a tennis tournament so in each match two participants compete (one of them will win and the other will lose).

Input

The only line contains three integers n, b, p (1 ≤ n, b, p ≤ 500) — the number of participants and the parameters described in the problem statement.

Output

Print two integers x and y — the number of bottles and towels need for the tournament.

Examples

Input

5 2 3


Output

20 15


Input

8 2 4


Output

35 32

Note

In the first example will be three rounds:

  1. in the first round will be two matches and for each match 5 bottles of water are needed (two for each of the participants and one for the judge), 
  2. in the second round will be only one match, so we need another 5 bottles of water, 
  3. in the third round will also be only one match, so we need another 5 bottles of water. 



So in total we need 20 bottles of water.

In the second example no participant will move on to some round directly.
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T pbs(T x, int k) {
  if (!k) return 1;
  if (k < 0) {
    x = 1 / x;
    k = -k;
  }
  T y = 1;
  while (k > 1) {
    if (k & 1) y *= x;
    x *= x;
    k = k >> 1;
  }
  return x * y;
}
template <typename T>
inline T parse(std::string s) {
  T v;
  std::istringstream istr(s);
  istr >> v;
  return v;
}
template <class T>
inline string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}
inline vector<string> split(const string& s, char delim = ' ') {
  vector<string> elems;
  stringstream ss(s);
  string item;
  while (getline(ss, item, delim)) elems.push_back(item);
  return elems;
}
template <class C>
inline ostream& print(C c, string sep = " ", string left = "",
                      string right = "") {
  cout << left;
  auto it = c.begin();
  if (c.size()) cout << *it++;
  for (; it != c.end(); it++) cout << sep << *it;
  return cout << right;
}
template <class C, typename T = typename C::value_type>
inline T max(C c) {
  return *max_element(begin(c), end(c));
}
template <class C, typename T = typename C::value_type>
inline T min(C c) {
  return *min_element(begin(c), end(c));
}
struct _ {
  _() {
    cin.sync_with_stdio(false);
    cin.tie(0);
  }
} _;
int main() {
  int n, b, p, k;
  cin >> n >> b >> p;
  long bottles = 0, towels = n * p;
  while (n > 1) {
    k = 1;
    while (k * 2 <= n) k *= 2;
    bottles += (k / 2) * (2 * b + 1);
    n = k / 2 + (n - k);
  }
  cout << bottles << " " << towels << '\n';
  return 0;
}
