Marinada '22

[lang=hr] Kees računa umnožak svih znamenki svakog $100$-znamenkastog broja, a zatim zbraja sve umnoške kako bi dobio $Y$. Budući da je $Y$ prilično velik broj, odlučio je rezultat $X$ zapisati kao $Y$ modulo svog omiljenog prostog broja, $10^9+7$. Odredi $X$ takav da je $0 \leq X < 10^9+7$ and $10^9+7 | Y-X$. [/lang] [lang=en] Kees computes the product of the digits of every $100$-digit number, then he adds all products together to make the number $Y$. Since $Y$ is quite a big number, he decides to reduce it modulo his favourite prime $10^9+7$ to $X$. Output the number $X$ such that $0 \leq X < 10^9+7$ i $10^9+7 | Y-X$. [/lang]