#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




string a;
vector<vector<int>> qr;

vector<int> consistency(int n, int q){
	
	vector<vector<int>> mp(n+1, vector<int>(26, 0));
	
	for(int i=0; i<n; i++){
		mp[i+1] = mp[i];
		mp[i+1][a[i] - 'a']++;
	}
	
	vector<int> ans;
	
	for(auto& qq : qr){
		int L = qq[0];
		int R = qq[1];
			
		int val = 0;
		for(int j=0; j<26; j++){
			
			int ct = mp[R][j] - mp[L-1][j];
			
			val += (ct * (ct+1))/2;
		}
		ans.push_back(val);
		
	}
	
	return ans;

}















vector<int> practice(int n, int q){


}





void solve() {
    
    int n, q;
    cin>> n >> q;
    	
    cin >> a;
    
    qr.resize(q);
    for(int i=0; i<q; i++) {
    	int x, y;
    	cin >> x >> y;
    	qr[i] = {x,y};
    }
    
    auto ans = consistency(n, q);
    
    for(auto& t : ans) cout << t << " "; cout << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}