#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
char c[1 << 20];
long long F[1 << 20];
long long I[1 << 20];
long long s[1 << 20];
signed main(void) {
  srand(time(0));
  cout << fixed << setprecision(7);
  cerr << fixed << setprecision(7);
  long long n, k;
  cin >> n >> k;
  long long ans = 0;
  cin >> (c + 1);
  for (long long i = 1; i <= n; ++i) c[i] -= '0';
  auto pow = [&](long long a, long long b, long long mod) {
    long long ans = 1;
    while (b) {
      if (b & 1) ans = (1ll * ans * a) % mod;
      a = (1ll * a * a) % mod;
      b /= 2;
    }
    return ans;
  };
  F[1] = F[0] = I[1] = I[0] = 1;
  for (long long i = 2; i <= 2e5; ++i) {
    F[i] = (1ll * F[i - 1] * i) % mod;
    I[i] = (1ll * I[i - 1] * pow(i, mod - 2, mod)) % mod;
  }
  auto C = [](long long n, long long k) {
    if (!(0 <= k && k <= n)) return 0ll;
    long long now = F[n];
    now = (1ll * now * I[n - k]) % mod;
    now = (1ll * now * I[k]) % mod;
    return now;
  };
  for (long long i = 1; i <= n; ++i) s[i] = s[i - 1] + c[i];
  for (long long w = 0; w <= n - 2; ++w) {
    long long now = pow(10, w, mod);
    now = (1ll * now * C(n - w - 2, k - 1)) % mod;
    now = (1ll * now * s[n - w - 1]) % mod;
    ans = (ans + now) % mod;
  }
  for (long long i = 0; i < n; ++i) {
    long long now = (1ll * c[i + 1] * pow(10, n - 1 - i, mod)) % mod;
    now = (1ll * now * C(i, k));
    ans = (ans + now) % mod;
  }
  cout << ans << '\n';
  return 0;
}
