#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int C = 26;
void add(int &x, int y) {
  x += y;
  while (x >= MOD) x -= MOD;
  while (x < 0) x += MOD;
}
int fix(int x) {
  while (x >= MOD) x -= MOD;
  while (x < 0) x += MOD;
  return x;
}
int pw(int a, int b) {
  int ret = 1;
  while (b) {
    if (b & 1) ret = 1ll * ret * a % MOD;
    b >>= 1;
    a = 1ll * a * a % MOD;
  }
  return ret;
}
int mul(int a, int b) { return (long long)a * b % MOD; }
const int MAXN = 1e5 + 10;
int n, k, a[MAXN];
string s;
int fact[MAXN], finv[MAXN], power[MAXN];
int binom(int x, int y) {
  if (y > x) return 0;
  return mul(fact[x], mul(finv[y], finv[x - y]));
}
void solve() {
  cin >> n >> k;
  cin >> s;
  for (int i = 0; i < n; i++) {
    a[i] = s[i] - '0';
  }
  if (k == 0) {
    int ans = 0;
    for (int i = 0; i < n; i++) {
      ans = mul(ans, 10);
      add(ans, a[i]);
    }
    cout << ans << "\n";
    return;
  }
  fact[0] = 1;
  for (int i = 1; i < MAXN; i++) {
    fact[i] = mul(i, fact[i - 1]);
  }
  finv[MAXN - 1] = pw(fact[MAXN - 1], MOD - 2);
  for (int i = MAXN - 2; ~i; --i) {
    finv[i] = mul(i + 1, finv[i + 1]);
  }
  power[0] = 1;
  for (int i = 1; i < MAXN; i++) {
    power[i] = mul(10, power[i - 1]);
  }
  int ans = 0;
  int contrib = 0;
  for (int x = 0; x < n; x++) {
    add(contrib, mul(power[x], binom(n - 2 - x, k - 1)));
  }
  int x = n - 2;
  for (int i = 0; i < n; i++) {
    int mx = n - 1 - i;
    while (x >= mx) {
      add(contrib, -mul(power[x], binom(n - 2 - x, k - 1)));
      --x;
    }
    add(ans, mul(contrib, a[i]));
    add(ans, mul(binom(i, k), mul(power[n - 1 - i], a[i])));
  }
  cout << ans << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int te = 1;
  for (int w = 1; w <= te; w++) {
    solve();
  }
  return 0;
}
