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

Solution:
    import java.util.*;

    public class App {
        public static void main(String[] args) {
            // questionA();
            questionB();
            
        }

        public static void questionA(){
            Scanner sc = new Scanner(System.in);

            int numTestCase = sc.nextInt();
            for(int i = 0 ; i < numTestCase; i++){
                long n = sc.nextLong();
                long x = sc.nextLong();
                long t = sc.nextLong();

                long output = contest(n, x, t);
                System.out.println(output); 
            }
        }

        public static void questionB(){
            Scanner sc = new Scanner(System.in);

            int songLength = sc.nextInt();
            int numQues = sc.nextInt();

            String songString = sc.next();

            List<Integer> arr = new ArrayList<>();
            List<Integer> prefixSum = new ArrayList<>();

            for(int i = 0; i < songString.length(); i++){
                arr.add(songString.charAt(i) - 'a' + 1);
            }

            for(int i = 0; i < arr.size(); i++){
                if (i == 0){
                    prefixSum.add(arr.get(i));
                } else {
                    prefixSum.add(prefixSum.get(i-1) + arr.get(i));
                }
            }

            // System.out.println(prefixSum);

            for (int i = 0; i < numQues; i++){
                int l = sc.nextInt()-1;
                int r = sc.nextInt()-1;

                int legnth = 0;

                if (l <= 0){
                    legnth = prefixSum.get(r);    
                } else {
                    legnth = prefixSum.get(r) - prefixSum.get(l-1);
                }

                System.out.println(legnth);
            }
        }

        public static int solveQuestion(List<Character> songSubString, int l, int r){
            int result = 0;
            
            for(int i = 0; i < songSubString.size(); i++){
                result += songSubString.get(i) - 'a' + 1;
            }

            return result;
        }

        public static long contest(long n, long x, long t){
            long firstNum = t / x;

            long times = n - firstNum - 1;

            if(firstNum >= n){
                return ((n-1) * (n) / 2);
            }

            return firstNum * times + (firstNum * (firstNum +1 ) / 2);

        }

        public static void printAL2D(List<List<String>> al){
            for(int i = 0; i < al.size(); i++){
                System.out.println(al.get(i));
            }
        }

        public static void printAL2DArr(List<List<String>> arr){
            for(int i = 0; i < arr.size(); i++){
                for(int j = 0; j < arr.get(0).size(); j++){
                    System.out.print(arr.get(i).get(j).charAt(0));
                }
                System.out.println();
            }
        }

        
        public static boolean tourney(List<Integer> players){
            List<Integer> playersSorted = new ArrayList<>(players);
            Collections.sort(playersSorted);
            int sum = playersSorted.get(2) + playersSorted.get(3);
            if (players.get(0) + players.get(2) == sum){
                return true;
            } else if (players.get(0) + players.get(3) == sum){
                return true;
            } else if (players.get(1) + players.get(2) == sum){
                return true;
            } else if (players.get(1) + players.get(3) == sum){
                return true;
            }
            return false;
        }


        public static void swap(int[] arr, int firstIndex, int secondIndex){
            int left = arr[firstIndex];
            int right = arr[secondIndex];
            arr[firstIndex] = right;
            arr[secondIndex] = left;
        }

        public static void printArr(int[] arr){
            for(int i = 0; i < arr.length; i++){
                System.out.print(arr[i] + " ");
            }
            System.out.println();
        }

        public static int sumArr(int[] arr){
            int result = 0;
            for(int i = 0; i < arr.length; i++){
                result += arr[i];
            }
            return result;
        }

        public static int[] sort(int[] arr){
            List<Integer> list = new ArrayList<>();
            for(int i = 0 ; i < arr.length; i++){
                list.add(arr[i]);
            }
            Collections.sort(list);
            int[] newArr =  new int[list.size()];
            for(int i = 0; i < list.size(); i++){
                newArr[i] = list.get(i);
            }
            return newArr;
        }

        public static int sumAL(List<Integer> arr){
            int result = 0;
            for(int i = 0; i < arr.size(); i++){
                result += arr.get(i);
            }
            return result;
        }
    }