Problem: Petya once wrote a sad love song and shared it to Vasya. The song is a string consisting of lowercase English letters. Vasya made up q questions about this song. Each question is about a subsegment of the song starting from the l-th letter to the r-th letter. Vasya considers a substring made up from characters on this segment and repeats each letter in the subsegment k times, where k is the index of the corresponding letter in the alphabet. For example, if the question is about the substring "abbcb", then Vasya repeats letter 'a' once, each of the letters 'b' twice, letter 'c" three times, so that the resulting string is "abbbbcccbb", its length is 10. Vasya is interested about the length of the resulting string.

Help Petya find the length of each string obtained by Vasya.

Input

The first line contains two integers n and q (1≤ n≤ 100 000, 1≤ q ≤ 100 000) — the length of the song and the number of questions. 

The second line contains one string s — the song, consisting of n lowercase letters of English letters.

Vasya's questions are contained in the next q lines. Each line contains two integers l and r (1 ≤ l ≤ r ≤ n) — the bounds of the question.

Output

Print q lines: for each question print the length of the string obtained by Vasya.

Examples

Input


7 3
abacaba
1 3
2 5
1 7


Output


4
7
11


Input


7 4
abbabaa
1 3
5 7
6 6
2 4


Output


5
4
1
5


Input


13 7
sonoshikumiwo
1 5
2 10
7 7
1 13
4 8
2 5
3 9


Output


82
125
9
191
62
63
97

Note

In the first example Vasya is interested in three questions. In the first question Vasya considers the substring "aba", that transforms to "abba", so the answer is equal to 4. In the second question Vasya considers "baca", that transforms to "bbaccca", so the answer is 7. In the third question Vasya considers the string "abacaba",that transforms to "abbacccabba" of length 11.

Solution (in CPP):

Solution:

#include<bits/stdc++.h>

using namespace std;

#define mii   map<int,int>
#define mui  multimap<int,int>
#define  vi   vector<int>
#define si set<int>
#define ll    long long
#define umii unordered_map<int, int>
#define ss second
#define pb push_back
#define ff first
#define mp make_pair
#define pii pair<int,int>
#define vpi vector<pii>
#define pq priority_queue<int>
#define pdq priority_queue<int, vi, greater<int> >
#define prl(x) {cout<<x<<endl;}
#define single solve(0);
#define testCases int t; cin>>t; for(int z1=1; z1<=t; z1++){ solve(z1);}
#define pb    push_back
#define w(t)         int t;cin>>t;while(t--)
#define int long long
#define   fr(a,b)  for( int i=a;i<=b;i++)
#define   frj(a,b)  for( int j=a;j<=b;j++)
#define   frr(a,b)  for( int i=a;i>=b;i--)
#define fastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define priarr(arr,st,en) for(int i=st;i<=en;i++)cout<<arr[i]<<" "; cout<<endl;
#define mod 1000000007
#define MOD 1000000007





// cin >> n >> m >> a;
// cout<< <<" "<< <<" ";
// if()
//   cout<<"YES\n";
// else
//   cout<<"NO\n";
//continue
//return




void solve(int test) {


  int n, c = 0, ans = 0, x, y;
  cin >> n >> x;
  string s;
  cin >> s;

  mii m;
  m[0] = 0;

  for (int i = 0; i < n; i++)
  {
    c += (s[i] - 'a' + 1);
    m[i + 1] = c;

  }
  while (x--)
  {
    int a, b;
    cin >> a >> b;

    cout << m[b] - m[a - 1] << "\n";
  }


  // cout << c  << "\n";

}



signed main()
{

#ifndef ONLINE_JUDGE
  freopen("input.txt", "r+" , stdin);

  freopen("out3.txt", "w+" , stdout);
#endif


  fastIO;

  single;

  // testCases;







}