题库练习 Segment Sum
← 上一题 下一题 →

A12233 | Segment Sum

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

You are given two integers $l$ and $r$ ( $l \le r$ ). Your task is to calculate the sum of numbers from $l$ to $r$ (including $l$ and $r$ ) such that each number contains at most $k$ different digits, and print this sum modulo $998244353$ .

For example, if $k = 1$ then you have to calculate all numbers from $l$ to $r$ such that each number is formed using only one digit. For $l = 10, r = 50$ the answer is $11 + 22 + 33 + 44 = 110$ .

输入格式

The only line of the input contains three integers $l$ , $r$ and $k$ ( $1 \le l \le r < 10^{18}, 1 \le k \le 10$ ) — the borders of the segment and the maximum number of different digits.

输出格式

Print one integer — the sum of numbers from $l$ to $r$ such that each number contains at most $k$ different digits, modulo $998244353$ .

输入输出样例

输入 #1
10 50 2
输出 #1
1230
输入 #2
1 2345 10
输出 #2
2750685
输入 #3
101 154 2
输出 #3
2189
C++ 编辑器
输入
输出