/**
链接:https://www.lydsy.com/JudgeOnline/problem.php?id=2038
题意 : 如中文题面 求选择两个数字相同的概率;
莫队裸题;
***tricks***
long long 分析当前区间左右相同数字选择变化
*/
#include<bits/stdc++.h>
#define ll long long
using namespace std;
/**********************************************Head-----Template****************************************/
bool Finish_read;
template<class T>inline void read(T &x){Finish_read=0;x=0;int f=1;char ch=getchar();while(!isdigit(ch)){if(ch=='-')f=-1;if(ch==EOF)return;ch=getchar();}while(isdigit(ch))x=x*10+ch-'0',ch=getchar();x*=f;Finish_read=1;}
template<class T>inline void print(T x){if(x/10!=0)print(x/10);putchar(x%10+'0');}
template<class T>inline void writeln(T x){if(x<0)putchar('-');x=abs(x);print(x);putchar('\n');}
template<class T>inline void write(T x){if(x<0)putchar('-');x=abs(x);print(x);}
ll gcd(ll a,ll b){return b==0?a:gcd(b,a%b);}
ll lcm(ll a,ll b){ll gg=gcd(a,b);a/=gg;if(a<=LLONG_MAX/b) return a*b;return LLONG_MAX;}
/********************************Head----Temlate**********************************************/
const int maxn=2e5+7;
struct node {
int l,r,id,len;
}a[maxn];
int cnt[maxn];
int pos[maxn],s[maxn];
ll d[maxn],val[maxn];
bool cmp(node a,node b){
if(pos[a.l]==pos[b.l]) return a.r<b.r;
return pos[a.l]<pos[b.l];
}
int n,m;
void solved(){
read(n),read(m);
int sz=sqrt(m);
for(int i=1;i<=n;i++) read(s[i]);
for(int i=1;i<=m;i++){
read(a[i].l),read(a[i].r);
pos[i]=(i-1)/sz+1;
a[i].id=i;
d[i]=1ll*(a[i].r-a[i].l)*(a[i].r-a[i].l+1)/2;
}
sort(a+1,a+m+1,cmp);
memset(cnt,0,sizeof(cnt));
int l=a[1].l,r=a[1].l-1; ll ans=0;
for(int i=1;i<=m;i++){
while(l<a[i].l) {
ans-=cnt[s[l]]-1;
cnt[s[l++]]--;
}
while(r<a[i].r){
ans+=cnt[s[++r]];
cnt[s[r]]++;
}
while(l>a[i].l){
ans+=cnt[s[--l]];
cnt[s[l]]++;
}
while(r>a[i].r){
ans-=cnt[s[r]]-1;
cnt[s[r--]]--;
}
val[a[i].id]=ans*1ll;
}
for(int i=1;i<=m;i++) {
ll tmp=gcd(d[i], val[i]);
printf("%lld/%lld\n",val[i]/tmp,d[i]/tmp);
}
}
int main (){
solved();
}