说是分块…
以为用指针游移就可以的……结果……会tle……
哦,,然后对一个质数m求逆元,有公式b^-1=b^(m-2)%m
//#include <iostream>
#include <stdio.h>
#include <math.h>
#include <algorithm>
#include <string.h>
using namespace std;
#define maxn 30010
#define ll __int64
ll mod;
ll cnt[maxn],ans[maxn],inv[maxn],a[maxn];
ll n,m;
ll ppow(ll m,ll n)
{
ll b=n,r=1,a=m;
while(b)
{
if(b&1) r=(r*a)%mod;
b>>=1;
a=(a*a)%mod;
}
return r;
}
class node
{
public:
ll l,r,num,bl;
/*bool operator < (node b)
{
if(bl!=b.bl) return bl<b.bl;
return r<b.r;
}*/
}pos[maxn];
void init()
{
ll i,j,k;
ll x,y;
for(i=1;i<maxn;i++)
{
/*exgcd(i,mod,x,y);
inv[i]=x;*/
inv[i]=ppow(i,mod-2)%mod;
//if(i<=5) printf("%I64d***",inv[i]);
}
}
int cmp(node a,node b)
{
if(a.bl!=b.bl) return a.bl<b.bl;
return a.r<b.r;
}
void solve()
{
ll i,j,k;
ll l=1,r=0,tmp=0,res=1;
for(i=1;i<=m;i++)
{
//printf(">>\n");
while(r<pos[i].r)
{
r++;
tmp++;
cnt[a[r]]++;//printf("**%I64d\n",inv[cnt[a[r]]]);
//cout<<"**"<<inv[cnt[a[r]]]++<<endl;
res=(res*tmp)%mod;
res=(res*inv[cnt[a[r]]])%mod;
}
while(r>pos[i].r)
{
//printf("**%I64d\n",inv[cnt[a[r]]]);//cout<<"**"<<inv[cnt[a[r]]]++<<endl;
res=(res*inv[tmp])%mod;
res=(res*cnt[a[r]])%mod;
cnt[a[r]]--;
r--;
tmp--;
}
while(l>pos[i].l)
{ l--;
tmp++;
cnt[a[l]]++;
res=(res*tmp)%mod;
res=(res*inv[cnt[a[l]]])%mod;
//printf("**%I64d\n",inv[cnt[a[r]]]);//cout<<"**"<<inv[cnt[a[r]]]++<<endl;
}
while(l<pos[i].l)
{
//printf("**%I64d\n",inv[cnt[a[r]]]);//cout<<"**"<<inv[cnt[a[r]]]++<<endl;
res=(res*inv[tmp])%mod;
res=(res*cnt[a[l]])%mod;
cnt[a[l]]--;
l++;
tmp--;
}
ans[pos[i].num]=res;
}
for(i=1;i<=m;i++) printf("%I64d\n",ans[i]);
}
int main()
{
int T;
mod=1e9+7;
scanf("%d",&T);
init();
while(T--)
{
//int n,m;
scanf("%I64d%I64d",&n,&m);
memset(cnt,0,sizeof(cnt));
int sqr=sqrt(n);
int i,j,k;
for(i=1;i<=n;i++) scanf("%I64d",&a[i]);
for(i=1;i<=m;i++)
{
scanf("%I64d%I64d",&pos[i].l,&pos[i].r);
pos[i].num=i;
pos[i].bl=pos[i].l/sqr;
// printf("l=%I64d r=%I64d num=%I64d bl=%I64d\n",pos[i].l,pos[i].r,pos[i].num,pos[i].bl);
}
sort(pos+1,pos+m+1,cmp);
//for(i=1;i<=m;i++) cout<<pos[i].r<<endl;
solve();
}
return 0;
}
/*2
4 2
1 2 1 3
1 3
1 4
1 1
1
1 1
*/