Problem: Shrek and the Donkey (as you can guess, they also live in the far away kingdom) decided to play a card game called YAGame. The rules are very simple: initially Shrek holds m cards and the Donkey holds n cards (the players do not see each other's cards), and one more card lies on the table face down so that both players cannot see it as well. Thus, at the beginning of the game there are overall m + n + 1 cards. Besides, the players know which cards the pack of cards consists of and their own cards (but they do not know which card lies on the table and which ones the other player has). The players move in turn and Shrek starts. During a move a player can:

  * Try to guess which card is lying on the table. If he guesses correctly, the game ends and he wins. If his guess is wrong, the game also ends but this time the other player wins.
  * Name any card from the pack. If the other player has such card, he must show it and put it aside (so that this card is no longer used in the game). If the other player doesn't have such card, he says about that.

Recently Donkey started taking some yellow pills and winning over Shrek. Now Shrek wants to evaluate his chances to win if he too starts taking the pills.

Help Shrek assuming the pills are good in quality and that both players using them start playing in the optimal manner.

Input

The first line contains space-separated integers m and n (0 ≤ m, n ≤ 1000).

Output

Print space-separated probabilities that Shrek wins and Donkey wins correspondingly; the absolute error should not exceed 10 - 9.

Examples

Input

0 3


Output

0.25 0.75


Input

1 0


Output

1 0


Input

1 1


Output

0.5 0.5

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline bool chkmin(T &a, const T &b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T>
inline bool chkmax(T &a, const T &b) {
  return a < b ? a = b, 1 : 0;
}
const int oo = 0x3f3f3f3f;
const int maxn = 2100;
int n, m;
double f[maxn + 5][maxn + 5];
int main() {
  scanf("%d%d", &n, &m);
  f[0][0] = 1;
  for (int ipj = (1), ipj_end_ = (n + m + 1); ipj < ipj_end_; ++ipj) {
    for (int i = (0), i_end_ = (ipj + 1); i < i_end_; ++i) {
      int j = ipj - i;
      if (!i)
        f[i][j] = 1. / (j + 1);
      else if (!j)
        f[i][j] = 1;
      else {
        double &u = f[j][i - 1], &v = f[j - 1][i];
        double invnj = 1. / (j + 1);
        double a = u + invnj, b = (1 - u - (1 + j - j * v) * invnj), c = -invnj,
               d = (1 + j - j * v) * invnj;
        f[i][j] = invnj;
        double mid = -c / a;
        if (mid > 0) {
          if (a + b < 0)
            chkmax(f[i][j], c + d);
          else
            chkmax(f[i][j], (a + b) * mid + c + d);
        }
        if (mid < 1) {
          if (b < 0)
            chkmax(f[i][j], b * mid + d);
          else
            chkmax(f[i][j], b + d);
        }
      }
    }
  }
  printf("%.15f %.15f\n", f[n][m], 1 - f[n][m]);
  return 0;
}