#include <bits/stdc++.h>
using namespace std;
long long expMod(long long base, long long ex, long long mod = 1000000007) {
  if (ex == 0) return 1;
  long long temp = expMod(base, ex / 2, mod);
  temp = (temp * temp) % mod;
  if (ex % 2) temp = (temp * base) % mod;
  return temp;
}
const int FNCRLIMIT = 200005;
long long fac[FNCRLIMIT], inf[FNCRLIMIT];
long long fncrmod = 1000000007;
void fillncr() {
  fac[0] = 1;
  inf[0] = 1;
  for (int i = 1; i < FNCRLIMIT; i++) {
    fac[i] = (fac[i - 1] * (i)) % fncrmod;
    inf[i] = expMod(fac[i], fncrmod - 2, fncrmod);
  }
}
long long ncr(int n, int r) {
  if (n < r) return 0;
  return (((fac[n] * inf[r]) % fncrmod) * inf[n - r]) % fncrmod;
}
int main() {
  fillncr();
  int n, k;
  cin >> n >> k;
  string s;
  cin >> s;
  n--;
  long long a[n];
  a[0] = ncr(n - 1, k - 1);
  for (int(i) = 0; (i) < (n - 1); (i)++)
    a[i + 1] = (expMod(10, i + 1) * ncr(n - i - 2, k - 1)) % 1000000007;
  for (int(i) = 0; (i) < (n - 1); (i)++) {
    a[i + 1] += a[i];
    a[i + 1] %= 1000000007;
  }
  int v[n];
  for (int(i) = 0; (i) < (n + 1); (i)++) v[i] = s[i] - '0';
  long long ans = 0;
  for (int i = 0; i < (n); i++) cerr << ((a)[i]) << " ";
  cerr << "\n";
  for (int(d) = 0; (d) < (n + 1); (d)++) {
    if (d != n) ans += v[d] * a[n - 1 - d];
    ans %= 1000000007;
    cerr << "ans"
         << ": " << ans << endl;
    ;
  }
  for (int(d) = 0; (d) < (n + 1); (d)++) {
    ans += v[d] * ((ncr(d, k) * expMod(10, n - d)) % 1000000007);
    ans %= 1000000007;
    cerr << "ans"
         << ": " << ans << endl;
    ;
  }
  cout << ans << "\n";
  return 0;
}
