Hello, codeforces!

Do y'all like my profile picture? I personally think it perfectly encapsulates this platform's ideals and values and it also aligns with my beliefs. Moreover, it really does a world of good to my mental health, so there is that.

Anyways, I have this really cool problem: You are given a string S of digits separated by the following operators: +, , -, /, ^(pow), $$$(xor), &, |, (, ). Parentheses have biggest priority, then: '^'(pow) > '/' > " > '+' > '-' > '&' > '|' > '$$$'(xor). The task is to find out in how many ways modulo 10^9 + 7 you can rearrange the characters of the string such that the result is a given X(X < 10). |S| <= 2 * 10 ^ 5. Time limit: 0.01 seconds Memory limit: common sense.

Happy Christmas to all my christian fellas!

Yours truly, Geanina