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 PYTHON3):

Solution:
from sys import stdin, stdout

N = 100000;

# Max size of tree
tree = [0] * (2 * N);

# function to build the tree
def build(arr) :

    # insert leaf nodes in tree
    for i in range(n) :
        tree[n + i] = arr[i];

    # build the tree by calculating parents
    for i in range(n - 1, 0, -1) :
        tree[i] = tree[i << 1] + tree[i << 1 | 1];

# function to update a tree node
def updateTreeNode(p, value) :

    # set value at position p
    tree[p + n] = value;
    p = p + n;

    # move upward and update parents
    i = p;

    while i > 1 :

        tree[i >> 1] = tree[i] + tree[i ^ 1];
        i >>= 1;

# function to get sum on interval [l, r)
def query(l, r) :

    res = 0;

    # loop to find the sum in the range
    l += n;
    r += n;

    while l < r :

        if (l & 1) :
            res += tree[l];
            l += 1

        if (r & 1) :
            r -= 1;
            res += tree[r];

        l >>= 1;
        r >>= 1

    return res;

question_n, q = [int(x) for x in stdin.readline().split()]
s = stdin.readline().strip()
a = []
for c in s:
    a.append(ord(c)-96)

n = len(a);
build(a);

for _ in range(q):
    l, r = [int(x) for x in stdin.readline().split()]
    stdout.write(str(query(l-1,r))+'\n')