Hamming distance queries

The Hamming distance between two binary strings $s$ and $t$ of equal length is the number of positions where the two values differ. For example, the Hamming distance between "00111" and "10101" is 2.

You are given binary strings $a$ and $b$. Write a program that answers the following query.

• p1 p2 len: print the Hamming distance between the substrings $a_{p_1} a_{p_1+1} \ldots a_{p_1+len-1}$ and $b_{p_2} b_{p_2+1} \ldots b_{p_2+len-1}$.

String indices start at 0.

The first line has the binary string $a$ and the second line has the binary string $b$. The length of each string is a positive integer at most 200,000.

The third line has the number of queries $q$ ($1 \le q \le 400{,}000$). Each of the next $q$ lines has one query as $p_1$, $p_2$, and $len$ separated by spaces ($1 \le len$, $0 \le p_1 \le |a| - len$, $0 \le p_2 \le |b| - len$).

Print the answer to each query on its own line, in the order the queries are given.