//#pragma comment(linker,"/STACK:102400000,102400000")
#include<stdio.h>
#include<iostream>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<string>
#define ll long long
#define db double
#define PB push_back
#define lson k<<1
#define rson k<<1|1
using namespace std;

const int N = 13;
const int M = 25;

ll f[N][N];
ll C[M][M];
void init()
{
    C[0][0]=1;
    for(int i=1;i<M;i++)
    {
        C[i][0]=1;
        for(int j=1;j<i;j++)
            C[i][j]=C[i-1][j]+C[i-1][j-1];
        C[i][i]=1;
    }
}

ll gcd(ll a,ll b)
{
    if(a>b) swap(a,b);
    while(a)
    {
        ll t=a;
        a=b%a;
        b=t;
    }
    return b;
}

int main()
{
#ifdef PKWV
//    freopen("in.in","r",stdin);
#endif // PKWV
    init();
    for(int i=1;i<N;i++)
    {
        for(int j=1;j<N;j++)
        {
            f[i][j]=f[i-1][j]+f[i][j-1]+C[i+j-2][i-1];
        }
    }
    int n,m;
    while(scanf("%d%d",&n,&m)+1)
    {
        ll res=f[n][m];
        ll ans=C[n+m][n];
        ll g=gcd(res,ans);
        printf("%I64d/%I64d\n",res/g,ans/g);
    }
    return 0;
}