#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
int n, m;
char as[200000];
long long a[200000];
long long mul_inv(long long a, long long b) {
  long long b0 = b, t, q;
  long long x0 = 0, x1 = 1;
  if (b == 1) return 1;
  while (a > 1) {
    q = a / b;
    t = b, b = a % b, a = t;
    t = x0, x0 = x1 - q * x0, x1 = t;
  }
  if (x1 < 0) x1 += b0;
  return x1;
}
long long fac[200000];
long long ten[200000];
long long d[200000];
long long s[200000];
int main() {
  int i, j, k;
  cin >> n >> m;
  scanf("%s", as);
  for (i = 0; i < n; i++) a[i] = as[i] - '0';
  fac[0] = 1, ten[0] = 1;
  for (i = 1; i <= n; i++)
    fac[i] = fac[i - 1] * i, fac[i] %= 1000000007, ten[i] = ten[i - 1] * 10,
    ten[i] %= 1000000007;
  if (m == 0) {
    long long dab = 0;
    for (i = n - 1; i >= 0; i--)
      dab += a[i] * ten[n - 1 - i], dab %= 1000000007;
    cout << dab;
    return 0;
  }
  for (i = n - 2; i >= m - 1; i--) {
    d[n - 2 - i] = fac[i] * mul_inv(fac[m - 1], 1000000007) % 1000000007 *
                   mul_inv(fac[i - m + 1], 1000000007) % 1000000007 *
                   ten[n - 2 - i] % 1000000007;
    s[n - 2 - i] = (n - 2 - i == 0 ? 0 : s[n - 2 - i - 1]) + d[n - 2 - i];
  }
  for (i = m - 2; i >= 0; i--) {
    s[n - 2 - i] = (n - 2 - i == 0 ? 0 : s[n - 2 - i - 1]) + d[n - 2 - i];
  }
  s[n - 1] = s[n - 2];
  long long dab = 0;
  for (i = 0; i < n; i++) {
    if (i <= m)
      dab += a[i] * s[n - 1 - i];
    else {
      dab += a[i] * (i == n - 1 ? 0 : s[n - 1 - i - 1]);
      dab += a[i] * ten[n - 1 - i] * fac[i] % 1000000007 *
             mul_inv(fac[m], 1000000007) % 1000000007 *
             mul_inv(fac[i - m], 1000000007) % 1000000007;
    }
    dab %= 1000000007;
  }
  cout << dab;
  return 0;
}
