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 C implements Runnable{
	public static void main (String[] args) {new Thread(null, new C(), "_cf", 1 << 28).start();}

	int MODULO = (int)1e9+7;
	int[] fact, tens;
	int max = 100100;

	public void run() {
		FastScanner fs = new FastScanner();
		PrintWriter out = new PrintWriter(System.out);
		System.err.println("Go!");

		fact = new int[max];
		fact[0] = fact[1] = 1;
		for(int i = 2; i < max; i++) {
			long temp = (long)fact[i-1] * i;
			temp %= MODULO;
			fact[i] = (int)temp;
		}
		
		tens = new int[max];
		tens[0] = 1;
		for(int i = 1; i < max; i++) {
			long temp = (long)tens[i - 1] * 10;
			temp %= MODULO;
			tens[i] = (int)temp;
		}
		
		int n = fs.nextInt(), k = fs.nextInt();
		char[] str = fs.next().toCharArray();
		int[] pref = new int[n];
		pref[0] = str[0]-'0';
		for(int i = 1; i < pref.length; i++) {
			pref[i] += pref[i-1];
			pref[i] += str[i]-'0';
		}

		long res = 0;
		if(k > 0) {
			for(int len = 1; len <= n-1; len++) {
				if(k-1 > n - len - 1) break;
				long choose = nChoosek(n - len - 1, k - 1);
				long sum = pref[n - len - 1];
				sum *= tens[len-1];
				sum %= MODULO;
				sum *= choose;
				sum %= MODULO;
				
				res += sum;
				res %= MODULO;
			}
		}
		
		for(int len = 1; len <= n; len++) {
			int idx = n - len;
			if(k > n - len) break;
			long choose = nChoosek(n - len, k);
			long sum = (long)tens[len-1] * (str[idx]-'0');
			sum %= MODULO;
			sum *= choose;
			sum %= MODULO;
			
			res += sum;
			res %= MODULO;
		}
		
		out.println(res);
		out.close();
	}

	int nChoosek(int n, int k) {
		long num = fact[n];
		long den = ((long)fact[k] * fact[n-k]) % MODULO;
		long res = div(num, den);
		return (int)res;
	}
	
	int div(long a, long b) {
		long temp = a;
		long inv = power(b, MODULO - 2, MODULO);
		while(inv < 0) inv += MODULO;
		temp *= inv;
		while(temp < 0) {
			temp += MODULO;
		}
		temp %= MODULO;
		return (int)temp;
	}

	long power (long x, long y, long m) {
		long res = 1;
		x %= m;
		while(y > 0) {
			if(y % 2 == 1) {
				res = (res * x) % m;
			}
			y = (y >> 1L);
			x = (x * x) % m;
		}
		return res;
	}


	void sort (int[] a) {
		int n = a.length;
		for(int i = 0; i < 50; i++) {
			Random r = new Random();
			int x = r.nextInt(n), y = r.nextInt(n);
			int temp = a[x];
			a[x] = a[y];
			a[y] = temp;
		}
		Arrays.sort(a);
	}

	class FastScanner {
		public int BS = 1<<16;
		public char NC = (char)0;
		byte[] buf = new byte[BS];
		int bId = 0, size = 0;
		char c = NC;
		double num = 1;
		BufferedInputStream in;

		public FastScanner() {
			in = new BufferedInputStream(System.in, BS);
		}

		public FastScanner(String s) throws FileNotFoundException {
			in = new BufferedInputStream(new FileInputStream(new File(s)), BS);
		}

		public char nextChar(){
			while(bId==size) {
				try {
					size = in.read(buf);
				}catch(Exception e) {
					return NC;
				}                
				if(size==-1)return NC;
				bId=0;
			}
			return (char)buf[bId++];
		}

		public int nextInt() {
			return (int)nextLong();
		}

		public long nextLong() {
			num=1;
			boolean neg = false;
			if(c==NC)c=nextChar();
			for(;(c<'0' || c>'9'); c = nextChar()) {
				if(c=='-')neg=true;
			}
			long res = 0;
			for(; c>='0' && c <='9'; c=nextChar()) {
				res = (res<<3)+(res<<1)+c-'0';
				num*=10;
			}
			return neg?-res:res;
		}

		public double nextDouble() {
			double cur = nextLong();
			return c!='.' ? cur:cur+nextLong()/num;
		}

		public String next() {
			StringBuilder res = new StringBuilder();
			while(c<=32)c=nextChar();
			while(c>32) {
				res.append(c);
				c=nextChar();
			}
			return res.toString();
		}

		public String nextLine() {
			StringBuilder res = new StringBuilder();
			while(c<=32)c=nextChar();
			while(c!='\n') {
				res.append(c);
				c=nextChar();
			}
			return res.toString();
		}

		public boolean hasNext() {
			if(c>32)return true;
			while(true) {
				c=nextChar();
				if(c==NC)return false;
				else if(c>32)return true;
			}
		}

		public int[] nextIntArray(int n) {
			int[] res = new int[n];
			for(int i = 0; i < n; i++) res[i] = nextInt();
			return res;
		}

	}

}