#include <bits/stdc++.h>
using namespace std;
int n, k;
const int N = 1e5 + 20;
const long long mod = 1e9 + 7;
char s[N];
long long fac[N], inv[N], G[N];
long long ksm(long long a, long long b) {
  long long ret = 1;
  while (b) {
    if (b & 1) ret = ret * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return ret;
}
inline long long C(long long n, long long m) {
  if (n < m) return 0;
  return fac[n] * inv[m] % mod * inv[n - m] % mod;
}
void init(int n) {
  fac[0] = 1;
  for (int i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % mod;
  inv[n] = ksm(fac[n], mod - 2);
  for (int i = n - 1; i >= 0; i--) inv[i] = inv[i + 1] * (1LL * i + 1) % mod;
  for (int i = 0; i <= n; i++) G[i] = C(n - i - 2, k - 1) * ksm(10, i) % mod;
  for (int i = 1; i <= n; i++) G[i] += G[i - 1], G[i] %= mod;
}
int main() {
  scanf("%d%d", &n, &k);
  init(n);
  scanf("%s", s + 1);
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    long long x = s[i] - '0';
    ans += G[n - i - 1] * x % mod;
    ans %= mod;
    ans += C(i - 1, k) * ksm(10, n - i) % mod * x % mod;
    ans %= mod;
  }
  printf("%lld\n", (ans + mod) % mod);
  return 0;
}
