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.*;
import java.io.*;

public class codeForces {

	
	public static void main(String[] args) {
		FastReader in = new FastReader();
		int n = in.nextInt();
		int q = in.nextInt();
		String s = in.nextLine();
		int[] a = new int[n+1];
		a[0]= 0;
		for(int i =0;i<n;i++) {
			a[i+1]= s.charAt(i)-96;
			a[i+1]+=a[i];
		}
		for(int i =0;i<q;i++) {
			int l=in.nextInt();
			int r= in.nextInt();
			System.out.println(a[r]-a[l-1]);
		}

		
		
		
		
	}
	
  

		
	

static class FastReader
	  {
	        BufferedReader br;
	        StringTokenizer st;
	 
	        public FastReader()
	        {
	            br = new BufferedReader(new
	                    InputStreamReader(System.in));
	        }
	 
	        String next()
	        {
	            while (st == null || !st.hasMoreElements())
	            {
	                try
	                {
	                    st = new StringTokenizer(br.readLine());
	                }
	                catch (IOException  e)
	                {
	                    e.printStackTrace();
	                }
	            }
	            return st.nextToken();
	        }
	        int nextInt()
	        {
	            return Integer.parseInt(next());
	        }
	 
	        long nextLong()
	        {
	            return Long.parseLong(next());
	        }
	 
	        double nextDouble()
	        {
	            return Double.parseDouble(next());
	        }
	        String nextLine()
	        {
	            String str = "";
	            try
	            {
	                str = br.readLine();
	            }
	            catch (IOException e)
	            {
	                e.printStackTrace();
	            }
	            return str;
	        }
	 
	        int [] readintarray(int n) {
	            int res [] = new int [n];
	            for(int i = 0; i<n; i++)res[i] = nextInt();
	            return res;
	        }
	        long [] readlongarray(int n) {
	            long res [] = new long [n];
	            for(int i = 0; i<n; i++)res[i] = nextLong();
	            return res;
	        }
	  }
    static boolean isPrime(int n)
    {

    // Check if number is less than
    // equal to 1
     if (n <= 1)
         return false;

    // Check if number is 2
     else if (n == 2)
         return true;

    // Check if n is a multiple of 2
     else if (n % 2 == 0)
         return false;

    // If not, then just check the odds
     for (int i = 3; i <= Math.sqrt(n); i += 2)
     {
        if (n % i == 0)
            return false;
     }
     return true;
    }

   static int getSum(int n)
   {    
       int sum = 0;
       
       while (n != 0)
      {
         sum = sum + n % 10;
         n = n/10;
      }
  
    return sum;
   }

    static long gcd(Long a, long b)
   {
    // Everything divides 0
    if (a == 0)
      return b;
    if (b == 0)
      return a;
  
    // base case
    if (a == b)
        return a;
  
    // a is greater
    if (a > b)
        return gcd(a-b, b);
    return gcd(a, b-a);
   }

     static void swap(int[] arr, int i, int j)
    {
       int temp = arr[i];
       arr[i] = arr[j];
       arr[j] = temp;
    }

    static int countDigit(long n)
    {
        return (int)Math.floor(Math.log10(n) + 1);
    }
    static long fastpower(long a,long b,int n ) {
    	long res =1;
    	while(b>0) {
    		if((b&1)!=0) {
    			res = (res* a % n)%n;
    		}
    		a = (a % n*a % n) % n;
    		b = b >> 1;
	            
    	}
    	return res;
    }
    static int catalan(int n)
    {
        int res = 0;
 
        // Base case
        if (n <= 1)
        {
            return 1;
        }
        for (int i = 0; i < n; i++)
        {
            res += catalan(i)
                * catalan(n - i - 1);
        }
        return res;
    }
    static int mod(int a, int m)
    {
        return (a%m + m) % m;
    }
}