#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <bits/stdc++.h>
#include <stack>

using namespace std;

#define For(i,j,n) for(int i=j;i<=n;i++)
#define mst(ss,b) memset(ss,b,sizeof(ss));

typedef  long long LL;

template<class T> void read(T&num) {
    char CH; bool F=false;
    for(CH=getchar();CH<‘0‘||CH>‘9‘;F= CH==‘-‘,CH=getchar());
    for(num=0;CH>=‘0‘&&CH<=‘9‘;num=num*10+CH-‘0‘,CH=getchar());
    F && (num=-num);
}
int stk[70], tp;
template<class T> inline void print(T p) {
    if(!p) { puts("0"); return; }
    while(p) stk[++ tp] = p%10, p/=10;
    while(tp) putchar(stk[tp--] + ‘0‘);
    putchar(‘\n‘);
}

const LL mod=1e9+7;
const double PI=acos(-1.0);
const int inf=1e9;
const int N=2e5+10;
const int maxn=500+10;
const double eps=1e-6;

int a[maxn];

 int gcd(int x,int y)
 {
     if(y==0)return x;
     return gcd(y,x%y);
 }
int main()
{
        int t;
        read(t);
        while(t--)
        {
            int n,m;
            read(n);read(m);
            mst(a,-1);
            int x,y;
            For(i,1,m)
            {
                read(x);read(y);
                a[x]=y;
            }
            int sum=0;
            if(a[n]==-1)a[n]=0;
            sum+=a[n];
            for(int i=n-1;i>2;i--)
            {
                if(a[i]==-1)a[i]=a[i+1];
                sum+=a[i];
            }
            if(a[1]==-1)a[1]=100;
            if(a[2]==-1)a[2]=a[1];
            int p,q;
            p=a[1]+a[2];
            q=sum+p;
            //if(q==0)
            int g=gcd(p,q);
            cout<<p/g<<"/"<<q/g<<endl;
        }
        return 0;
}