#include <bits/stdc++.h>
using namespace std;
long long MOD = int(1e9) + 7;
inline int inp() {
  register int n = 0, s = 1, c = getchar();
  if (c == '-') s = -1;
  while (c < 48) c = getchar();
  while (c > 47) n = (n << 3) + (n << 1) + c - '0', c = getchar();
  return n * s;
}
inline void writeInt(long long n) {
  long long N = n, rev, count = 0;
  rev = N;
  if (N == 0) {
    putchar('0');
    putchar('\n');
    return;
  }
  while ((rev % 10) == 0) {
    count++;
    rev /= 10;
  }
  rev = 0;
  while (N != 0) {
    rev = (rev << 3) + (rev << 1) + N % 10;
    N /= 10;
  }
  while (rev != 0) {
    putchar(rev % 10 + '0');
    rev /= 10;
  }
  while (count--) putchar('0');
}
const int N = 1000 * 100 + 5;
int debug = 1;
long long s[N];
long long fact[N], inv[N];
long long powmod(long long a, long long b) {
  if (b == 0) return 1;
  long long ret = 1;
  while (b) {
    if (b & 1) (ret *= a) %= MOD;
    a = (a * a) % MOD;
    b >>= 1;
  }
  return ret;
}
long long ncr(long long n, long long r) {
  if (n < 0 || n < r || r < 0) return 0;
  return fact[n] * inv[r] % MOD * inv[n - r] % MOD;
}
int main() {
  ios::sync_with_stdio(false);
  int i, j, n, k, t;
  cin >> n >> k;
  string a;
  cin >> a;
  fact[0] = inv[0] = 1;
  for (i = 1; i < N; i++) {
    fact[i] = fact[i - 1] * (long long)i % MOD;
    inv[i] = powmod(fact[i], MOD - 2);
  }
  for (i = 1; i < N; i++) {
    s[i] = s[i - 1] + ncr(n - i - 1, k - 1) * powmod(10, i - 1);
    s[i] %= MOD;
  }
  a = " " + a;
  if (k == 0) {
    long long ans = 0;
    for (i = 1; i < a.size(); i++) ans = (ans * 10 + a[i] - '0') % MOD;
    cout << ans;
  } else {
    long long ans = 0;
    for (i = 1; i < n; i++) {
      long long index = min(n - k, n - i);
      ans += (s[index] * (long long)(a[i] - '0'));
      ans %= MOD;
    }
    for (i = 1; i <= n; i++) {
      ans += ncr(i - 1, k) * (long long)(a[i] - '0') % MOD * powmod(10, n - i) %
             MOD;
      ans %= MOD;
    }
    cout << ans;
  }
  cin >> i;
}
