Vasya is sitting on an extremely boring math class. To have fun, he took a piece of paper and wrote out n numbers on a single line. After that, Vasya began to write out different ways to put pluses ("+") in the line between certain digits in the line so that the result was a correct arithmetic expression; formally, no two pluses in such a partition can stand together (between any two adjacent pluses there must be at least one digit), and no plus can stand at the beginning or the end of a line. For example, in the string 100500, ways 100500 (add no pluses), 1+00+500 or 10050+0 are correct, and ways 100++500, +1+0+0+5+0+0 or 100500+ are incorrect.

The lesson was long, and Vasya has written all the correct ways to place exactly k pluses in a string of digits. At this point, he got caught having fun by a teacher and he was given the task to calculate the sum of all the resulting arithmetic expressions by the end of the lesson (when calculating the value of an expression the leading zeros should be ignored). As the answer can be large, Vasya is allowed to get only its remainder modulo 109 + 7. Help him!

Input

The first line contains two integers, n and k (0 ≤ k < n ≤ 105).

The second line contains a string consisting of n digits.

Output

Print the answer to the problem modulo 109 + 7.

Examples

Input

3 1
108


Output

27

Input

3 2
108


Output

9

Note

In the first sample the result equals (1 + 08) + (10 + 8) = 27.

In the second sample the result equals 1 + 0 + 8 = 9.
import java.io.*;
import java.util.*;
public class Task {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskE solver = new TaskE();
        solver.solve(1, in, out);
        out.flush();out.close();
    }
        static class TaskE {
        final int MAX=100010,mod=(int)(1E9)+7;
        int n,k;
        String s;
        long fac[]=new long[MAX],ifac[]=new long[MAX];
        long mul(long a,long b){
        	a*=b;
        	if(a>=mod)a%=mod;
        	return a;
        }
        long add(long a,long b){
        	a+=b;
        	if(a>=mod)a-=mod;
        	return a;
        }
        long sub(long a,long b){
        	a-=b;
        	if(a<0)a+=mod;
        	return a;
        }
        long rpe(long a,long b){
        	long ans=1;
        	while(b!=0){
        		if((b&1)!=0)ans=mul(ans,a);
        		a=mul(a,a);b>>=1;
        	}return ans;
        }
        void pre(){
        	fac[0]=1;
        	ifac[0]=1;
        	for(int i=1;i<MAX;i++){
        		fac[i]=mul(i,fac[i-1]);
        		ifac[i]=rpe(fac[i],mod-2);
        	}
        }
        long cal(int n,int r){
        	if(r>n||n<0)return 0;
        	return mul(fac[n],mul(ifac[r],ifac[n-r]));
        }
        long cal0(){
        	long ans=0;
        	for(int i=0;i<n;i++){
        		ans=add(mul(ans,10),s.charAt(i)-'0');
        	}
        	return ans;
        }
        long PS(){
        	long ans=0;long val=0;
        	for(int i=1;i<=n;i++){
        		val=add(mul(val,10),s.charAt(i-1)-'0');
        		ans=add(ans,mul(val,cal(n-1-i,k-1)));
        	}
        	val=0;long mul=1;
        	for(int i=n;i>=1;i--){
        		val=add(val,mul(mul,s.charAt(i-1)-'0'));
        		ans=add(ans,mul(val,cal(i-2,k-1)));
        		mul=mul(mul,10);
        	}
        	return ans;
        }
	 	  public void solve(int testNumber, InputReader in, PrintWriter out) {
	 	  	pre();
 			n=in.nextInt();k=in.nextInt();
 			s=in.next().trim();
 			if(k==0){
 				out.print(cal0());return;
 			}
 			long ans=PS();
 			if(k==1){
 				out.print(ans);return;
 			}
 			int p=n-2;
 			long add=0,sub=0,mul=1;
 			for(int i=n-1;i>=2;i--){
 				add=add(add,mul(mul,cal(p,k-1)));
 				sub=add(mul(10,sub),cal(n-1-i,k-1));
 				ans=add(ans,mul(s.charAt(i-1)-'0',sub(add,sub)));
 				--p;mul=mul(mul,10);
 			}
 			out.print(ans);
          }
//         pair ja[][];long w[];int from[],to[],c[];
//             void make(int n,int m,InputReader in){
//              ja=new pair[n+1][];w=new long[m];from=new int[m];to=new int[m];c=new int[n+1];
//              for(int i=0;i<m;i++){
//               int u=in.nextInt(),v=in.nextInt();long wt=in.nextLong();
//               c[u]++;c[v]++;from[i]=u;to[i]=v;w[i]=wt;
//              }
//              for(int i=1;i<=n;i++){
//               ja[i]=new pair[c[i]];c[i]=0;
//              }
//              for(int i=0;i<m;i++){
//               ja[from[i]][c[from[i]]++]=new pair(to[i],w[i]);
//               ja[to[i]][c[to[i]]++]=new pair(from[i],w[i]);
//              }
//             }
//        int[] radixSort(int[] f){ return radixSort(f, f.length); }
//	int[] radixSort(int[] f, int n)
//	{
//		int[] to = new int[n];
//		{
//			int[] b = new int[65537];
//			for(int i = 0;i < n;i++)b[1+(f[i]&0xffff)]++;
//			for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];
//			for(int i = 0;i < n;i++)to[b[f[i]&0xffff]++] = f[i];
//			int[] d = f; f = to;to = d;
//		}
//		{
//			int[] b = new int[65537];
//			for(int i = 0;i < n;i++)b[1+(f[i]>>>16)]++;
//			for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];
//			for(int i = 0;i < n;i++)to[b[f[i]>>>16]++] = f[i];
//			int[] d = f; f = to;to = d;
//		}
//		return f;
//	}
    }
    static class InputReader {
        BufferedReader br;
        StringTokenizer st;
        public InputReader(InputStream stream) {
            br = new BufferedReader(new InputStreamReader(stream));
            st = null;
        }

        String next() {
            while (st == null || !st.hasMoreTokens()) {
                String s = null;
                try {
                    s = br.readLine();
                } catch (IOException e) {
                    e.printStackTrace();
                }
                if (s == null)
                    return null;
                st = new StringTokenizer(s);
            }
            return st.nextToken();
        }

        boolean hasMoreTokens() {
            while (st == null || !st.hasMoreTokens()) {
                String s = null;
                try {
                    s = br.readLine();
                } catch (IOException e) {
                    e.printStackTrace();
                }
                if (s == null)
                    return false;
                st = new StringTokenizer(s);
            }
            return true;
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
        public long nextLong() {
            return Long.parseLong(next());
        }
        public double nextDouble() {
            return Double.parseDouble(next());
        }
    }
}