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.

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class Main {
	
	
	
//    ***                          ++                      
// +=-==+                      +++=-                     
//+-:---==+                   *+=----=                   
//+-:------==+               ++=------==                  
//=-----------=++=========================                
//+--:::::---:-----============-=======+++====             
//+---:..:----::-===============-======+++++++++           
//=---:...---:-===================---===++++++++++         
//+----:...:-=======================--==+++++++++++        
//+-:------====================++===---==++++===+++++      
//+=-----======================+++++==---==+==-::=++**+     
//+=-----================---=======++=========::.:-+*****    
//+==::-====================--:  --:-====++=+===:..-=+*****   
//+=---=====================-...  :=..:-=+++++++++===++*****  
//+=---=====+=++++++++++++++++=-:::::-====+++++++++++++*****+ 
//+=======++++++++++++=+++++++============++++++=======+****** 
//+=====+++++++++++++++++++++++++==++++==++++++=:...  . .+**** 
//++====++++++++++++++++++++++++++++++++++++++++-.     ..-+**** 
//+======++++++++++++++++++++++++++++++++===+====:.    ..:=++++ 
//+===--=====+++++++++++++++++++++++++++=========-::....::-=++* 
//====--==========+++++++==+++===++++===========--:::....:=++*  
//====---===++++=====++++++==+++=======-::--===-:.  ....:-+++   
//==--=--====++++++++==+++++++++++======--::::...::::::-=+++    
//===----===++++++++++++++++++++============--=-==----==+++     
//=--------====++++++++++++++++=====================+++++++     
//=---------=======++++++++====+++=================++++++++     
//-----------========+++++++++++++++=================+++++++    
//=----------==========++++++++++=====================++++++++  
//=====------==============+++++++===================+++==+++++ 
//=======------==========================================++++++

// created by : pritam kumar

    static long LowerBound(long[] a2, long x) { // x is the target value or key
  int l=-1,r=a2.length;
  while(l+1<r) {
    int m=(l+r)>>>1;
    if(a2[m]>=x) r=m;
    else l=m;
  }
  return r;
}
static int UpperBound(int a[], int x) {// x is the key or target value
    int l=-1,r=a.length;
    while(l+1<r) {
       int m=(l+r)>>>1;
       if(a[m]<=x) l=m;
       else r=m;
    }
    return l+1;
 }
    static void ruffleSort(long[] a) {
		int n=a.length;
		Random r=new Random();
		for (int i=0; i<a.length; i++) {
			long oi=r.nextInt(n), temp=a[i];
			a[i]=a[(int)oi];
			a[(int)oi]=temp;
		}
		Arrays.sort(a);
	}
static void ruffleSort(int[] a) {
		int n=a.length;
		Random r=new Random();
		for (int i=0; i<a.length; i++) {
			int oi=r.nextInt(n), temp=a[i];
			a[i]=a[oi];
			a[oi]=temp;
		}
		Arrays.sort(a);
	}
    public static int findIndex(long arr[], long t) 
    { 
 
        // if array is Null 
        if (arr == null) { 
            return -1; 
        } 
 
        // find length of array 
        int len = arr.length; 
        int i = 0; 
 
        // traverse in the array 
        while (i < len) { 
 
            // if the i-th element is t 
            // then return the index 
            if (arr[i] == t) { 
                return i; 
            } 
            else { 
                i = i + 1; 
            } 
        } 
        return -1; 
    }
 
    static int gcd(int a, int b)
    {
        if (a == 0)
            return b; 
        return gcd(b % a, a); 
    }
 
    // method to return LCM of two numbers
    static int lcm(int a, int b)
    {
        return (a / gcd(a, b)) * b;
    }
 
    public static int[] swap(int a[], int left, int right)
    {
 
        // Swap the data
        int temp = a[left];
        a[left] = a[right];
        a[right] = temp;
 
        // Return the updated array
        return a;
    }
//    public static pair swap(long max0,long max1)
//    {
//    	pair p=new pair(0, 0);
//    	long temp=max0;
//    	max0=max1;
//    	max1=temp;
//    	p.x=max0;
//    	p.y=max1;
//    	return p;
//    	
//    }
    public static void swap(int max0,int max1)
    {
    	int temp=max0;
    	max0=max1;
    	max1=temp;
    }
 
    public static int[] reverse(int a[], int left, int right)
    {
 
        // Reverse the sub-array
        while (left < right) {
            int temp = a[left];
            a[left++] = a[right];
            a[right--] = temp;
        }
 
        // Return the updated array
        return a;
    }
 
  
	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;
        }
    } 
	static boolean prime[] ;
		static void sieve(int n)
		{
			prime= new boolean[n+1];
	        for (int i = 0; i <= n; i++)
	            prime[i] = true;
	        prime[0]=false;
	        prime[1]=false;
	        for (int p = 2; p * p <= n; p++)
	        {
	            if (prime[p] == true)
	            {
	                for (int i = p * p; i <= n; i += p)
	                    prime[i] = false;
	            }
	        }
	    }
	    static long[][] a;
	    static ArrayList<Integer>[] tree;
	    static long[][] dp;
	    static void bin(int n)
	    {
	        if (n > 1)
	            bin(n / 2);
	        System.out.print(n % 2);
	    }
	public static void main(String[] args) {
		FastReader s=new FastReader();
		long n=s.nextInt();
		long k=s.nextInt();
		String str=s.next();
		HashMap<Character,Integer>map=new HashMap<>();
		for(int i=97;i<=122;i++)
		{
			int a=i;
			char c=(char)a;
			int temp=i-96;
//			System.out.println(c+" "+temp);
			map.put(c, temp);
		}
		long[] dp=new long[(int) n];
		dp[0]=map.get(str.charAt(0));
		for(int i=1;i<n;i++)
		{
			dp[i]=dp[i-1]+map.get(str.charAt(i));
		}
		while(k-->0)
		{
			int l=s.nextInt()-1;
			int r=s.nextInt()-1;
			if(l<=0)System.out.println(dp[r]);
			else 
			{
				System.out.println(dp[r]-dp[l-1]);
			}
			
		}
		 
	}
	private static boolean isps(int x) {
		if(x>=0)
		{
			long sr=(long)Math.sqrt(x);
			return (sr*sr==x);
		}
		return false;
	}
	private static boolean solver(int[]arr,int n,int sum,boolean[][] mat)
    {
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=sum;j++)
            {
                if(arr[i-1]<=j)
                {
                    mat[i][j]=mat[i-1][j-arr[i-1]]||mat[i-1][j];
                }
                else mat[i][j]=mat[i-1][j];
            }
        }
        return mat[n][sum];
    }
	static void dfs(int v, int p){
        dp[0][v] = 0;
        dp[1][v]=0;
 
        for(int u: tree[v])
        {
            if(u!=p) {
 
 
                dfs(u, v);
                dp[0][v] += Math.max(Math.abs(a[0][v] - a[1][u]) + dp[1][u], Math.abs(a[0][v] - a[0][u]) + dp[0][u]);
                dp[1][v] += Math.max(Math.abs(a[1][v] - a[1][u]) + dp[1][u], Math.abs(a[1][v] - a[0][u]) + dp[0][u]);
            }
 
 
        }
    }
}
class pair{
	long x;
	long y;
	public pair(long x,long y)
	{
		this.x=x;
		this.y=y;
	}
}
	
