#include <bits/stdc++.h>
using namespace std;
template <class T>
void debug(T a, T b) {
  ;
}
template <class T>
void chmin(T& a, const T& b) {
  if (a > b) a = b;
}
template <class T>
void chmax(T& a, const T& b) {
  if (a < b) a = b;
}
namespace std {
template <class S, class T>
ostream& operator<<(ostream& out, const pair<S, T>& a) {
  out << '(' << a.first << ',' << a.second << ')';
  return out;
}
}  // namespace std
long long int readL() {
  long long int res;
  scanf("%I64d", &res);
  return res;
}
void printL(long long int res) { printf("%I64d", res); }
template <long long int mod>
struct Int_ {
  unsigned x;
  unsigned mpow(Int_ a, unsigned k) {
    Int_ res = 1;
    while (k) {
      if (k & 1) res = res * a;
      a = a * a;
      k >>= 1;
    }
    return res.x;
  }
  unsigned inverse(Int_ a) { return mpow(a, mod - 2); }
  Int_() : x(0) {}
  Int_(long long sig) {
    if (sig < 0)
      x = sig % mod + mod;
    else
      x = sig % mod;
  }
  unsigned get() const { return (unsigned)x; }
  Int_& operator+=(Int_ that) {
    if ((x += that.x) >= mod) x -= mod;
    return *this;
  }
  Int_& operator-=(Int_ that) {
    if ((x += mod - that.x) >= mod) x -= mod;
    return *this;
  }
  Int_& operator*=(Int_ that) {
    x = (unsigned long long)x * that.x % mod;
    return *this;
  }
  Int_& operator=(Int_ that) {
    x = that.x;
    return *this;
  }
  Int_& operator/=(Int_ that) {
    x = (unsigned long long)x * inverse(that.x) % mod;
    return *this;
  }
  bool operator==(Int_ that) const { return x == that.x; }
  bool operator!=(Int_ that) const { return x != that.x; }
  Int_ operator-() const { return Int_(0) - Int_(*this); }
  Int_ operator+(Int_ that) const { return Int_(*this) += that; }
  Int_ operator-(Int_ that) const { return Int_(*this) -= that; }
  Int_ operator*(Int_ that) const { return Int_(*this) *= that; }
  Int_ operator/(Int_ that) const { return Int_(*this) /= that; }
};
namespace std {
template <long long int mod>
ostream& operator<<(ostream& out, const Int_<mod>& a) {
  out << a.get();
  return out;
}
template <long long int mod>
istream& operator>>(istream& in, Int_<mod>& a) {
  in >> a.x;
  return in;
}
};  // namespace std
Int_<1000000007> fact[200005], invf[200005];
Int_<1000000007> sum[100005];
int k, n;
Int_<1000000007> C(int n, int k) {
  if (k < 0 || n < k) return 0;
  return fact[n] * invf[k] * invf[n - k];
}
char s[100005];
Int_<1000000007> powT[100005];
int main() {
  cin >> n >> k;
  scanf("%s", s);
  fact[0] = invf[0] = powT[0] = 1;
  const Int_<1000000007> one = 1;
  for (int i = 0; i < (200002); ++i) {
    fact[i + 1] = fact[i] * (i + 1);
    invf[i + 1] = one / fact[i + 1];
  }
  for (int i = 0; i < (n); ++i) powT[i + 1] = powT[i] * 10;
  for (int i = 0; i < (n); ++i) {
    sum[i + 1] = sum[i] + C(n - i - 2, k - 1) * powT[i];
  }
  Int_<1000000007> res = 0;
  for (int i = 0; i < (n); ++i) {
    res += sum[i] * (s[n - 1 - i] - '0');
    res += C(n - 1 - i, k) * powT[i] * (s[n - 1 - i] - '0');
  }
  cout << res << endl;
  return 0;
}
