#include <bits/stdc++.h>
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
using namespace std;
inline bool isDigit(char c) { return '0' <= c && c <= '9'; }
template <class T>
inline T sqr(T x) {
  return x * x;
}
template <class T>
inline bool isSquare(T x) {
  T y = sqrt(x + 0.5);
  return (y * y) == x;
}
template <class T1, class T2>
inline T1 gcd(T1 a, T2 b) {
  return b ? gcd(b, a % b) : a;
}
template <class T1, class T2>
inline T1 eqMin(T1 &x, const T2 &y) {
  if (T1(y) < x) return x = y;
  return x;
}
template <class T1, class T2>
inline T1 eqMax(T1 &x, const T2 &y) {
  if (T1(y) > x) return x = y;
  return x;
}
template <class T1, class T2>
inline T1 min(const T1 &x, const T2 &y) {
  return x < (T1)y ? x : (T1)y;
}
template <class T1, class T2>
inline T1 max(T1 &x, const T2 &y) {
  return x > (T1)y ? x : (T1)y;
}
template <typename T>
inline T getint() {
  T x = 0, p = 1;
  char ch;
  do {
    ch = getchar();
  } while (ch <= ' ');
  if (ch == '-') p = -1, ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  return x * p;
}
template <class T1, class T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T>
auto operator<<(ostream &os, const T &v)
    -> decltype(v.begin(), v.end(), declval<ostream &>()) {
  os << '{';
  bool was = false;
  for (const auto &x : v) {
    if (was) os << ", ";
    was = true;
    os << x;
  }
  os << '}';
  return os;
}
template <size_t sz>
ostream &operator<<(ostream &os, const bitset<sz> &bit) {
  os << '/';
  for (int i = 0; i < sz; i++) os << bit[i];
  os << '\\';
  return os;
}
const double PI = acos(-1);
const double EPS = 1e-8;
const int INF = (int)2e9;
const long long LINF = (long long)2e18;
const int MOD = (int)1e9 + 7;
const int MAXN = (int)1e5 + 10;
int n, k;
vector<int> v;
long long fact[MAXN], step[MAXN], s, ans;
void precalc() {
  fact[0] = 1;
  step[0] = 1;
  for (int i = 1; i < MAXN; i++) {
    fact[i] = ((long long)fact[i - 1] * i) % MOD;
    step[i] = ((long long)step[i - 1] * 10) % MOD;
  }
}
void input() {
  cin >> n >> k;
  string s;
  cin >> s;
  for (char ch : s) {
    v.push_back(ch - '0');
  }
}
long long power(long long x, int step) {
  int ans = 1;
  while (step) {
    if (step & 1) {
      ans = ((long long)ans * x) % MOD;
    }
    x = ((long long)x * x) % MOD;
    step >>= 1;
  }
  return ans;
}
long long C(int n, int k) {
  return (fact[n] * power(((long long)fact[k] * fact[n - k]) % MOD, MOD - 2)) %
         MOD;
}
void solve() {
  s = 0;
  reverse(v.begin(), v.end());
  for (int i = 1; i <= n; i++) {
    int &d = v[i - 1];
    if (n - i >= k) {
      ans = (ans + (d * (step[i - 1] * C(n - i, k)) % MOD) % MOD) % MOD;
    }
    ans = (ans + (d * s) % MOD) % MOD;
    if (i <= n - k) {
      s = (s + (step[i - 1] * C(n - i - 1, k - 1)) % MOD) % MOD;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  precalc();
  input();
  solve();
  cout << ans;
}
