2018-01-10 13:00 CET



2018-01-17 13:00 CET
The end is near!
Contest is over.
Not yet started.
Contest is starting in -66 days 6:18:57

Time elapsed


Time remaining


Problem I

According to a popular belief, computer programmers drink a lot of coffee and know only a few words. The vocabulary of a typical programmer consists of just three words. Besides, he rarely knows how to spell them. To help programmers with their spelling mistakes, we published a book titled The Dictionary of the Three Words Every Typical Programmer Should Know.

You got a copy of the book but, soon after that, you spilled your coffee over it. Now, you cannot read some of the characters. Fortunately, the three words were, as usually in dictionaries, distinct and printed in lexicographical order.

Before you attempt to use that fact to recover the missing characters, you want to know in how many different ways you can do it. Since you expect this number might be large, you want to know it modulo $10^9 + 9$.


The first line of input contains the number of test cases $T$ ($1 \leq T \leq 114\, 000$). The descriptions of the test cases follow:

Each test case consists of three lines, each containing a single nonempty word—in the order they appear in the dictionary. Words consist of lower case letters of the English alphabet and question marks, the latter denoting missing characters. Each word is at most $1\, 000\, 000$ characters long.

The total number of characters in all test cases is at most $3\, 000\, 000$.


For each test case, output one line containing the number of different ways you can substitute each question mark with one of the $26$ letters from a to z in such a way that the three words are distinct and in lexicographical order. The number should be printed modulo $10^9 + 9$.

Sample Input 1 Sample Output 1