func_code_string: #include <bits/stdc++.h>   using namespace std;   const int MOD = 998244353;   const int M = 20;   pair<int, int> dp[M][(1 << 10)];   int a[M], K, ten[M];   int Count(int st) {     int rnt = 0;     while (st) st &= st - 1, rnt++;     return rnt;   }   pair<int, int> f(int pos, int st, int lead, int limit) {     if (pos == -1)       return Count(st) <= K ? pair<int, int>(0, 1) : pair<int, int>(0, 0);     if (!limit && dp[pos][st].first != -1) return dp[pos][st];     int up = limit ? a[pos] : 9;     pair<int, int> rnt = pair<int, int>(0, 0);     for (int k = 0; k <= up; k++) {       pair<int, int> p = f(pos - 1, k == 0 && lead ? 0 : st | (1 << k),                            k == 0 && lead, limit && k == up);       rnt.first =           (rnt.first + p.first + (long long)k * ten[pos] % MOD * p.second % MOD) %           MOD;       rnt.second = (rnt.second + p.second) % MOD;     }     if (!limit) dp[pos][st] = rnt;     return rnt;   }   pair<int, int> Solve(long long n) {     for (int i = 0; i < M; i++, n /= 10) a[i] = n % 10;     return f(M - 1, 0, 1, 1);   }   int main() {     for (int i = 0; i < M; i++) {       ten[i] = i == 0 ? 1 : ten[i - 1] * 10ll % MOD;       for (int j = 0; j < (1 << 10); j++) dp[i][j].first = -1;     }     long long l, r;     scanf( %I64d%I64d%d , &l, &r, &K);     pair<int, int> R = Solve(r), L = Solve(l - 1);     printf( %d n , (R.first - L.first + MOD) % MOD);     return 0;   }   