#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define for1(i,a,b) for(long long i = (long long) (a);i <= (long long) (b);++ i)
#define for0(i,a,b) for(long long i = (long long) (a);i >= (long long) (b);-- i)
ll n, q, a[200010], ans, m, x, y; 
bool cmp (ll u, ll o){
	return u>o;
}
int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >>n >>q;
	for1 (i, 1, n){
		cin >>a[i];
	}
	sort (a+1, a+n+1, cmp);
	for1 (i, 2, n){
		a[i] += a[i-1];
	}
	++ q;
	while (-- q){
		cin >>x >>y;
		m = 0, ans = 0;
		while (1){
			m += x;
			if (m > n)	break;
			ans += a[m]-a[m-y];
		}
		cout <<ans <<endl;
	}
	return 0;
}

https://www.luogu.com.cn/problem/U516404