#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
pair<long long, long long> dp[19][1024];
int a[19];
int d;
long long pw[20];
long long n;
void update(long long &a, long long b) { a = (a + b) % mod; }
pair<long long, long long> dfs(int len, int ok, bool flag, bool zero) {
  if (len == -1) {
    return make_pair(1, 0);
  }
  if (!flag && !zero && dp[len][ok].first != -1) return dp[len][ok];
  pair<long long, long long> ans = make_pair(0, 0);
  int limit = flag ? a[len] : 9;
  for (int i = 0; i <= limit; ++i) {
    int mask = ok | (1 << i);
    if (i == 0 && zero) mask = ok;
    if (__builtin_popcount(mask) > d) continue;
    pair<long long, long long> to =
        dfs(len - 1, mask, flag && i == a[len], zero && i == 0);
    update(ans.first, to.first);
    update(ans.second, to.second);
    update(ans.second, 1LL * to.first * pw[len] % mod * i % mod);
  }
  if (!flag) dp[len][ok] = ans;
  return ans;
}
long long cal(long long n) {
  int len = -1;
  while (n) {
    a[++len] = n % 10;
    n /= 10;
  }
  for (int i = 0; i < 19; ++i)
    for (int j = 0; j < 1024; ++j) dp[i][j] = make_pair(-1, -1);
  return dfs(len, 0, 1, 1).second;
}
int main() {
  pw[0] = 1;
  for (int i = 1; i < 20; ++i) pw[i] = pw[i - 1] * 10 % mod;
  long long l, r;
  cin >> l >> r >> d;
  printf("%lld\n", (cal(r) - cal(l - 1) + mod) % mod);
  return 0;
}
