Problem: The dragon and the princess are arguing about what to do on the New Year's Eve. The dragon suggests flying to the mountains to watch fairies dancing in the moonlight, while the princess thinks they should just go to bed early. They are desperate to come to an amicable agreement, so they decide to leave this up to chance.

They take turns drawing a mouse from a bag which initially contains w white and b black mice. The person who is the first to draw a white mouse wins. After each mouse drawn by the dragon the rest of mice in the bag panic, and one of them jumps out of the bag itself (the princess draws her mice carefully and doesn't scare other mice). Princess draws first. What is the probability of the princess winning?

If there are no more mice in the bag and nobody has drawn a white mouse, the dragon wins. Mice which jump out of the bag themselves are not considered to be drawn (do not define the winner). Once a mouse has left the bag, it never returns to it. Every mouse is drawn from the bag with the same probability as every other one, and every mouse jumps out of the bag with the same probability as every other one.

Input

The only line of input data contains two integers w and b (0 ≤ w, b ≤ 1000).

Output

Output the probability of the princess winning. The answer is considered to be correct if its absolute or relative error does not exceed 10 - 9.

Examples

Input

1 3


Output

0.500000000


Input

5 5


Output

0.658730159

Note

Let's go through the first sample. The probability of the princess drawing a white mouse on her first turn and winning right away is 1/4. The probability of the dragon drawing a black mouse and not winning on his first turn is 3/4 * 2/3 = 1/2. After this there are two mice left in the bag — one black and one white; one of them jumps out, and the other is drawn by the princess on her second turn. If the princess' mouse is white, she wins (probability is 1/2 * 1/2 = 1/4), otherwise nobody gets the white mouse, so according to the rule the dragon wins.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long power(long long b, long long p) {
  if (b == 0) return 0;
  long long res = 1;
  while (p) {
    if (p % 2) {
      res = (res * b) % 998244353;
      p--;
    } else {
      b = (b * b) % 998244353;
      p /= 2;
    }
  }
  return res;
}
long long Root(long long r, vector<long long> &root) {
  while (root[r] != r) {
    root[r] = root[root[r]];
    r = root[r];
  }
  return r;
}
void EE(long long a, long long b, long long &x, long long &y) {
  long long t;
  if (b == 0) {
    y = 0, x = 1;
    return;
  }
  EE(b, a % b, x, y);
  t = x;
  x = y;
  y = t - a / b * y;
}
void build(long long node, long long start, long long end, vector<long long> &a,
           vector<long long> &tree) {
  if (start == end) {
    tree[node] = a[start];
    return;
  }
  long long mid = (start + end) / 2;
  build(2 * node, start, mid, a, tree);
  build(2 * node + 1, mid + 1, end, a, tree);
  tree[node] = tree[2 * node] + tree[2 * node + 1];
}
long long query(long long node, long long start, long long end, long long l,
                long long r, vector<long long> &tree, vector<long long> &lazy) {
  if (lazy[node]) {
    tree[node] = end - start + 1 - tree[node];
    if (start != end) {
      lazy[2 * node] = lazy[2 * node] ^ 1;
      lazy[2 * node + 1] = lazy[2 * node + 1] ^ 1;
    }
    lazy[node] = 0;
  }
  if (start >= l && end <= r) {
    return tree[node];
  }
  if (l > end || r < start) return 0;
  long long mid = (start + end) / 2;
  return query(2 * node, start, mid, l, r, tree, lazy) +
         query(2 * node + 1, mid + 1, end, l, r, tree, lazy);
}
void update(long long node, long long start, long long end, long long l,
            long long r, vector<long long> &tree, vector<long long> &lazy) {
  if (lazy[node]) {
    tree[node] = end - start + 1 - tree[node];
    if (start != end) {
      lazy[2 * node] = lazy[2 * node] ^ 1;
      lazy[2 * node + 1] = lazy[2 * node + 1] ^ 1;
    }
    lazy[node] = 0;
  }
  if (l > end || r < start) return;
  if (start >= l && end <= r) {
    tree[node] = end - start + 1 - tree[node];
    if (start != end) {
      lazy[2 * node] = lazy[2 * node] ^ 1;
      lazy[2 * node + 1] = lazy[2 * node + 1] ^ 1;
    }
    return;
  }
  long long mid = (start + end) / 2;
  update(2 * node, start, mid, l, r, tree, lazy);
  update(2 * node + 1, mid + 1, end, l, r, tree, lazy);
  tree[node] = tree[2 * node] + tree[2 * node + 1];
}
void dfs(long long r, queue<long long> &q, vector<long long> &st,
         vector<long long> &vis, vector<vector<long long> > &v) {
  vis[r] = 1;
  long long i;
  for (i = 0; i < v[r].size(); i++)
    if (!vis[v[r][i]]) dfs(v[r][i], q, st, vis, v);
  if (st[r]) q.push(r);
}
void dfs1(long long r, vector<long long> &vis, vector<vector<long long> > &v,
          long long &c) {
  c++;
  vis[r] = 1;
  long long i;
  for (i = 0; i < v[r].size(); i++)
    if (!vis[v[r][i]]) dfs1(v[r][i], vis, v, c);
}
double rec(double w, double b, vector<vector<double> > &dp) {
  if (b < 0) return 0;
  if (dp[w][b] != -1) return dp[w][b];
  if (w == 0) return dp[w][b] = 0;
  if (b <= 0 && w) return dp[w][b] = 1;
  if (b <= 0) return dp[w][b] = 0;
  double res;
  if (w + b == 2) return dp[w][b] = .5;
  res = w / (w + b) + b / (b + w) * (b - 1) / (b + w - 1) *
                          (w / (w + b - 2) * rec(w - 1, b - 2, dp) +
                           (b - 2) / (w + b - 2) * rec(w, b - 3, dp));
  return dp[w][b] = res;
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  srand(time(NULL));
  ;
  double w, b, res;
  cin >> w >> b;
  vector<vector<double> > dp(w + 1, vector<double>(b + 1, -1));
  res = rec(w, b, dp);
  printf("%.15lf", res);
}