Shopping With Grandma II

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX (101)
ld dp[2*MX][MX],dd[2*MX][MX];
ld dyn(int s,int b){
    if(!b)return s;
    ld &v(dp[s][b]);
    if(v>-ZERO)return v;
    if(!s)return v=dyn(1,b-1);
    return v=(s*dyn(s-1,b)+b*dyn(s+1,b-1))/(s+b);
}
ld dyp(int s,int b){
    if(!b)return 0;
    ld &v(dd[s][b]);
    if(v>-ZERO)return v;
    if(!s)return v=dyp(1,b-1)+1;
    return v=(s*dyp(s-1,b)+b*dyp(s+1,b-1))/(s+b)+1;
}
int A,B;
int main(void){
    F(2*MX)FF(MX)dp[i][j]=-666;
    F(2*MX)FF(MX)dd[i][j]=-666;
    dyn(MX-1,MX-1);
    while(scanf("%d%d",&A,&B),A|B){
        printf("%.12lf %.12lf\n",A?dp[B][A]:B,dyp(B,A));
    }
    return 0;
}