E. Expected Damage(概率)

const int N = 2e5+5, M = 26;
ll p[N];
int d[N];
int main()
{
	//freopen("in.txt", "r", stdin);
	int n, m;
	while (cin >> n >> m)
	{
		f(i, 1, n)d[i] = in();
		sort(d + 1, d + 1 + n);
		f(i, 1, n)p[i] = p[i - 1] + d[i];
		f(i, 1, m)
		{
			int a = in(), b = in();
			//可以破盾的
			ll num_of_big = n+1-(lower_bound(d + 1, d + 1 + n, b) - d);
			ll re = max(num_of_big - a,(ll)0);//破完盾剩下的破盾者
			ll exp1 = re * inv(num_of_big, mod2)%mod2;//每个破盾者造成伤害可能性
			ll ans = (p[n] - p[n - num_of_big])%mod2*exp1%mod2;
			//隔板法算弱者贡献，在第a个破盾者后面的弱者是有伤害的
			if (num_of_big < a) { cout << 0 << endl;continue; }
			ll exp2 = (num_of_big - a + 1)*inv(num_of_big + 1,mod2)%mod2;
			ll num_of_ruo = n - num_of_big;
			ans = (ans + p[num_of_ruo]%mod2 * exp2%mod2) % mod2;
			cout << ans << endl;
		}
	}
	return 0;
}