#include <bits/stdc++.h>
using namespace std;
#define mp(a,b) make_pair(a,b)
#define ff first
#define setp(x) setprecision(x)<<fixed
#define ss second
#define fori(v) for(lli i=0; i<v; i++)
#define forj(v) for(lli j=0; j<v; j++)
#define fork(v) for(lli k=0; k<v; k++)
#define forl(v) for(lli l=0; l<v; l++)
#define fort(v) for(lli t=0; t<v; t++)
#define forz(v) for(lli z=0; z<v; z++)
#define lli long long int
#define MAX (lli)100010
#define MAX2 205
#define double long double
#define pb push_back
int inf = pow(10,9);
lli modulo = pow(10,9)+7;
double eps = 1e-11;
ifstream in;
ofstream out;
//#define cin in
//#define cout out
int fakt(int n){
	if(!n)
		return 1;
	return n*fakt(n-1);
}
int gcd(int a,int b){
	return !b ? a :gcd(b,a%b);
}
void deal(){
	int t;
	cin>>t;
	assert(t<=10);
	forz(t){
		int n,m;
		cin>>n>>m;
		assert(n<=10);
		assert(m<=9);
		int arr[n], answer[n], pairs[m][2], ordered[m][2], seq[m], arr1[n];
		fori(n){
			cin>>arr[i];
			assert(arr[i]>=1);
			assert(arr[i]<=inf);
		}
		fori(m){
			forj(2)	
				cin>>pairs[i][j];
			assert(pairs[i][0]>=1);
			assert(pairs[i][1]<=n);
			assert(pairs[i][0]<=pairs[i][1]);
		}
		fori(n)	answer[i] = arr[i];
		fori(m)	reverse(answer+pairs[i][0]-1, answer+pairs[i][1]);
		fori(m)	seq[i] = i;
		int sum = 0;
		do{
			fori(m)		forj(2)		ordered[i][j] = pairs[seq[i]][j];
			fori(n)		arr1[i] = arr[i];
			fori(m)		reverse(arr1+ordered[i][0]-1, arr1+ordered[i][1]);
			bool k = 1;
			fori(n)
				if(arr1[i] != answer[i]){
					k = 0;
					break;
				}
			sum+=k;
		}while(next_permutation(seq,seq+m));
		int overall = fakt(m);
		int ebob = gcd(overall,sum);
		sum/=ebob;
		overall/=ebob;
		cout<<sum<<"/"<<overall<<'\n';
	}
}
int main(){
//	freopen("i1.txt", "r", stdin);
//	freopen("o1.txt", "wb", stdout);
	deal();
}
// 1 3 3  2 1 3 1 2 2 3 1 3