CF1051E.Vasya and Big Integers

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

The first line contains a single integer $a~(1 \le a \le 10^{1000000})$ .

The second line contains a single integer $l~(0 \le l \le 10^{1000000})$ .

The third line contains a single integer $r~(0 \le r \le 10^{1000000})$ .

It is guaranteed that $l \le r$ .

It is also guaranteed that numbers $a, l, r$ contain no leading zeros.

Print a single integer — the amount of partitions of number $a$ such that they match all the given requirements modulo $998244353$ .

In the first test case, there are two good partitions $13+5$ and $1+3+5$ .

In the second test case, there is one good partition $1+0+0+0+0$ .

In the first test case, there are two good partitions $13+5$ and $1+3+5$ .

In the second test case, there is one good partition $1+0+0+0+0$ .