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.ArrayList;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.util.List;
 import java.util.*;
 public class realfast implements Runnable 
  {
    private static final int INF = (int) 1e9;
    long in= 1000000007;
    long fac[]= new long[100010];
    long inv[]= new long[100010];
    public  void solve() throws IOException 
    {

        fac[0]=1;
        inv[0]=1;
        inv[1]=1;
        fac[1]=1;
        for(int i =2;i<=100000;i++)
        {
            fac[i]= (i*fac[i-1])%in;
            inv[i]= pow(fac[i],in-2,in)%in;
        }




      

      int n = readInt();
      int k = readInt();

      String s = readString();

      int arr[]=new int[n+1];
      long ll =0;
      for(int i =0;i<n;i++)
      {
          arr[i+1]= (int)s.charAt(i)-48;
          ll = ((ll*10)%in + arr[i+1])%in;
      }

      if(k>0){
      for(int i=1;i<=n;i++)
        arr[i]= arr[i]+arr[i-1];

      long ans =0;
      for(int i =1;i<=n-1;i++)
      {
        long val = pow(10,i-1,in);
        long sum = arr[n-i]-arr[0];
        long gal = ncr(n-i-1,k-1);
        //out.println(gal);
        //out.println(sum);
        ans = (ans%in + (((val*sum)%in)*(gal%in))%in)%in;
      }

        //out.println(ans);
     // out.println(ans);
      long val =0;

      for(int i=n;i>=1;i--)
      {
          val = ((arr[i]-arr[i-1])*pow(10,n-i,in))%in;
        //  out.println(val);
          //out.println((i-1)+" "+k);
          long gal = ncr(i-1,k);
         // out.println(gal);
          gal = (gal*val)%in;
          ans = (ans%in + gal%in)%in;
      }


      out.println(ans);

     }
     else
        out.println(ll);
      

    }
    public long ncr(int n , int r )
    {
        if(r<0||n<r)
            return 0;
        long val = fac[n];

        long val1 = inv[r];
        val1  = (val1* inv[n-r])%in;

        val1= (val1*val)%in;


        return val1;

    }
    
    public int value (int seg[], int left , int right ,int index, int l, int r)
    {
            
            if(left>right)
            {
              return -100000000;
            }
            if(right<l||left>r)
                return -100000000;
            if(left>=l&&right<=r)
                return seg[index];
            int mid = left+(right-left)/2;
            int val = value(seg,left,mid,2*index+1,l,r);
            int val2 = value(seg,mid+1,right,2*index+2,l,r);
            return Math.max(val,val2);

    }
   
    public int gcd(int a , int b )
    {
      if(a<b)
      {
        int t =a;
        a=b;
        b=t;
      }
      if(a%b==0)
        return b ;
      return gcd(b,a%b);
    }
    public long pow(long n , long p,long m)
    {
         if(p==0)
            return 1;
        long val = pow(n,p/2,m);;
        val= (val*val)%m;
        if(p%2==0)
            return val;
        else
            return (val*n)%m;
    }
    
    
    ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////
    public static void main(String[] args) {
        new Thread(null, new realfast(), "", 128 * (1L << 20)).start();
    }
 
    private static final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
    private BufferedReader reader;
    private StringTokenizer tokenizer;
    private PrintWriter out;
 
    @Override
    public void run() {
        try {
            if (ONLINE_JUDGE || !new File("input.txt").exists()) {
                reader = new BufferedReader(new InputStreamReader(System.in));
                out = new PrintWriter(System.out);
            } else {
                reader = new BufferedReader(new FileReader("input.txt"));
                out = new PrintWriter("output.txt");
            }
            solve();
        } catch (IOException e) {
            throw new RuntimeException(e);
        } finally {
            try {
                reader.close();
            } catch (IOException e) {
                // nothing
            }
            out.close();
        }
    }
 
    private String readString() throws IOException {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(reader.readLine());
        }
        return tokenizer.nextToken();
    }
 
    @SuppressWarnings("unused")
    private int readInt() throws IOException {
        return Integer.parseInt(readString());
    }
 
    @SuppressWarnings("unused")
    private long readLong() throws IOException {
        return Long.parseLong(readString());
    }
 
    @SuppressWarnings("unused")
    private double readDouble() throws IOException {
        return Double.parseDouble(readString());
    }
}
class edge implements Comparable<edge>{
    int val ;
    int color;
    
    edge(int u, int v)
    {
       this.val=u;
       this.color=v;
    }
    public int compareTo(edge e)
    {
        return this.val-e.val;
    }
}