#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
const int MOD = 1e9 + 7;
int nn, kk;
char s[maxn];
long long perm_1[maxn], perm_sum[maxn];
long long quick_mod(long long a, long long b) {
  long long ret = 1;
  a %= MOD;
  while (b) {
    if (b & 1) {
      ret = ret * a % MOD;
      b--;
    }
    b >>= 1;
    a = a * a % MOD;
  }
  return ret;
}
long long C(long long n, long long m) {
  if (m > n) return 0;
  if (m < 1) return 1;
  long long ret = 1;
  for (int i = 1; i <= m; i++) {
    long long a = (n + i - m) % MOD;
    long long b = i % MOD;
    ret = ret * (a * quick_mod(b, MOD - 2) % MOD) % MOD;
  }
  return ret;
}
int fac[maxn], inv[maxn];
inline int c(int x, int y) {
  return x < y ? 0 : (long long)fac[x] * inv[y] % MOD * inv[x - y] % MOD;
}
void init2() {
  fac[0] = 1;
  for (int i = 1; i < nn; i++) fac[i] = (long long)fac[i - 1] * i % MOD;
  inv[0] = inv[1] = 1;
  for (int i = 1; i < nn; i++)
    inv[i] = (long long)inv[i - MOD % i] * (MOD / i + 1) % MOD;
  for (int i = 1; i < nn; i++) inv[i] = (long long)inv[i] * inv[i - 1] % MOD;
}
void init() {
  perm_sum[0] = c(nn - 2, kk - 1);
  long long p = 10;
  for (int i = 1; i < nn - kk; i++) {
    perm_sum[i] = (perm_sum[i - 1] + p * c(nn - 2 - i, kk - 1)) % MOD;
    p = p * 10 % MOD;
  }
  p = 1;
  for (int i = nn - 1; i > kk - 1; i--) {
    perm_1[i] = c(i, kk) * p % MOD;
    p = p * 10 % MOD;
  }
}
void run() {
  scanf("%d%d%s", &nn, &kk, s);
  init2();
  init();
  long long ans = 0;
  if (0 == kk) {
    long long p = 1;
    for (int i = nn - 1; i >= 0; i--) {
      ans += (s[i] - '0') * p;
      p = p * 10 % MOD;
      if (ans > MOD) ans %= MOD;
    }
  } else {
    int len_max = nn - 1 - kk;
    for (int i = 0; i < nn; i++) {
      int len_left = nn - 1 - i;
      if (len_left > len_max)
        ans += (s[i] - '0') * perm_sum[len_max];
      else if (len_left) {
        ans += (s[i] - '0') * (perm_sum[len_left - 1] + perm_1[i]);
      } else {
        ans += (s[i] - '0') * (perm_1[i]);
      }
      if (ans > MOD) ans %= MOD;
    }
  }
  cout << ans << endl;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  ;
  run();
  return 0;
}
