#P6392. Egg Tart Feast

    ID: 19608 Type: Default 1000ms 256MiB

Egg Tart Feast

Egg Tart Feast

Given two magical numbers a and b, determine the final number of egg tarts that Tianyi can eat based on the following process:

  • First, pre-cook 2a+2 egg tarts.
  • Then, multiply that number by b to obtain k = b \times 2a+2.
  • Tianyi likes round hundreds. Thus, let p = \lceil \frac{k}{25} \rceil \times 100, where \lceil x \rceil means rounding up to the nearest integer.
  • Finally, to ensure Tianyi doesn't eat too many, take p modulo 998344353.

Your task is to compute and output p \bmod 998344353 given the numbers a and b.

inputFormat

The input consists of a single line with two integers a and b separated by a space.

outputFormat

Output a single integer, which is the value of p \bmod 998344353.

sample

1 1
100