SP21354 CLZSTRNG - String Problem

Mr.Avantgarde has 2 binary strings s1 and s2. He wants to convert s1 into s2. But this task isn't as easy as it looks. He has to convert s1 to s2 in exactly k steps. In each step, he can select exactly m chars and xor each of them by 1. Help him to find in how many ways can he convert s1 into s2 by using method described above.Output answer mod 1000000009. Constraints: Test cases

N/A

N/A