#include <bits/stdc++.h>
using namespace std;
const int md = 1000000007;
void Add(int &x, int y) {
  x += y;
  if (x >= md) x -= md;
}
int Fac[100005], Inv[100005];
int n, K;
int Fast(int x, int k) {
  int res = 1;
  while (k) {
    if (k & 1) res = 1ll * res * x % md;
    k >>= 1;
    x = 1ll * x * x % md;
  }
  return res;
}
void Init() {
  Fac[0] = Inv[0] = 1;
  for (int i = (1), i_END_ = (n); i <= i_END_; ++i) {
    Fac[i] = 1ll * Fac[i - 1] * i % md;
    Inv[i] = Fast(Fac[i], md - 2);
  }
}
int C(int x, int y) {
  if (x < y) return 0;
  return 1ll * Fac[x] * Inv[x - y] % md * Inv[y] % md;
}
int dp[100005];
char str[100005];
int main() {
  scanf("%d%d", &n, &K);
  scanf("%s", str + 1);
  if (!K) {
    int res = 0;
    for (int i = (1), i_END_ = (n); i <= i_END_; ++i)
      res = (1ll * res * 10 % md + str[i] - '0') % md;
    printf("%d\n", res);
    return 0;
  }
  Init();
  int base = 1;
  for (int i = (1), i_END_ = (n); i <= i_END_; ++i) {
    dp[i] = 1ll * base * C(n - 1 - i, K - 1) % md;
    Add(dp[i], dp[i - 1]);
    base = 1ll * base * 10 % md;
  }
  int ans = 0;
  base = 1;
  for (int i = (n), i_END_ = (1); i >= i_END_; --i) {
    int k = str[i] - '0';
    Add(ans, 1ll * k * dp[n - i] % md);
    Add(ans, 1ll * k * base % md * C(i - 1, K) % md);
    base = 1ll * base * 10 % md;
  }
  printf("%d\n", ans);
  return 0;
}
