#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <map>
#include <vector>
#include <queue>
#include <cstring>
#include <string>
#include <algorithm>
using namespace std;
typedef  long long  ll;
typedef unsigned long long ull;
#define MM(a,b) memset(a,b,sizeof(a));
#define inf 0x7f7f7f7f
#define FOR(i,n) for(int i=1;i<=n;i++)
#define CT continue;
#define PF printf
#define SC scanf
const int mod=1000000007;
const int N=1e3+10;

ll gcd(ll a,ll b)
{
    if(b==0) return a;
    else return gcd(b,a%b);
}

int main()
{
    ll n,m;
    while(~scanf("%lld%lld",&n,&m)&&(n||m))
    {
      ll fenzi=n*(m-1),fenmu=m*m;
      while(1)
      {
          ll k=gcd(fenzi,fenmu);
          if(k==1) break;
          fenzi/=k;fenmu/=k;
      }
      printf("%lld/%lld\n",fenzi,fenmu);
    }
    return 0;
}