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 path_hooks, stdin, stdout
from collections import Counter,deque
import math
from copy import deepcopy
import random
import heapq
from itertools import permutations, repeat
from time import time

from bisect import bisect_left
from bisect import bisect_right
from re import findall
from fractions import Fraction
from typing import DefaultDict


 
# int(stdin.readline().strip())
# stdin.readline().strip()
# list(map(int,stdin.readline().split()))
# map(int,stdin.readline().split())
'''
n = int(stdin.readline())
s = stdin.readline().strip()
n, k = map(int, stdin.readline().split())
arn = list(map(int, stdin.readline().split()))
'''

def gcd(a,b):
    if(b==0):
        return a
    else:
        return gcd(b,a%b)

def SieveOfEratosthenes(n):
    prime = [True for i in range(n + 1)]
    p = 2
    while (p * p <= n):
        if (prime[p] == True):
            for i in range(p * 2, n + 1, p):
                prime[i] = False
        p += 1
    prime[0]= False
    prime[1]= False
    ans = []
    for p in range(n + 1):
        if prime[p]:
            ans.append(p)
    return ans

# t = time()
# primes = SieveOfEratosthenes(5000002)

# spprime = set([2,3,5,7])
# for i in primes:
#     if i//10 in spprime:
#         spprime.add(i)

# spprime = list(spprime)
# spprime.sort()

#print(time() - t)

spprime = [2, 3, 5, 7, 23, 29, 31, 37, 53, 59, 71, 73, 79, 233, 239, 293, 311, 313, 317, 373, 379, 593, 599, 719, 733, 739, 797, 2333, 2339, 2393, 2399, 2939, 3119, 3137, 3733, 3739, 3793, 3797, 5939, 7193, 7331, 7333, 7393, 23333, 23339, 23399, 23993, 29399, 31193, 31379, 37337, 37339, 37397, 59393, 59399, 71933, 73331, 73939, 233993, 239933, 293999, 373379, 373393, 593933, 593993, 719333, 739391, 739393, 739397, 739399, 2339933, 2399333, 2939999, 3733799]
spprimeset = set(spprime)

coprime1 = {6: 100003, 5: 10007, 4: 1009, 3: 101, 2: 11, 1: 2, 7: 1000003, 8: 10000019, 9: 100000007}
coprime2 = {8:10000169,9:100000049,7:1000033,6:100019,5:10009,4:1013,3:103,2:13,1:3}
 
def writ(ss):
    stdout.write(str(ss) + "\n")

mod = (10 **9) + 7

def binaryr(arr,point,target):
    low = 0
    high = point
    while low <= high:
        mid = (low+high)//2
        if arr[mid] == target:
            return mid 
        elif arr[mid] < target:
            low = mid + 1 
        else:
            high = mid - 1
    return low 

def binaryl(arr,point,target):
    low = 0
    high = point
    while low <= high:
        mid = (low+high)//2
        if arr[mid] == target:
            return mid 
        elif arr[mid] < target:
            low = mid + 1 
        else:
            high = mid - 1
    return high

def sump(n):
    return (n * (n+1)) // 2 


#print(spprime)
n , q = map(int, stdin.readline().split())
s = stdin.readline().strip()
score = {}
c = 1
for i in sorted("qwertyuiopasdfghjklzxcvbnm"):
    score[i] = c
    c += 1
lis = {}
for i in "qwertyuiopasdfghjklzxcvbnm":
    lis[i] = [0] * (n+1)
for i in range(n):
    for j in lis:
        if j == s[i]:
            lis[j][i+1] = lis[j][i] + 1
        else:
            lis[j][i+1] = lis[j][i]


def solve():
    l , r = map(int, stdin.readline().split())
    ans = 0
    for i in "qwertyuiopasdfghjklzxcvbnm":
        coun = lis[i][r] -  lis[i][l-1]
        ans += coun * score[i]
    return ans

    
for test in range(q):

            
    print(solve())