You are given an array A containing N integers where every integer is represented as a 23-bit binary string. You are also given the following function:
F(x,y)=Length of Longest Common Suffix of x and y
Write a program to resolve Q queries of the following types:
Input format
Output format
For each query of the second type, print the required sum.
Constraints
1≤N,Q≤105
1≤L≤R≤N
1≤A[i],x≤8388607
410 =000 0000 0000 0000 0000 01002
510 =000 0000 0000 0000 0000 01012
610 =000 0000 0000 0000 0000 01102
110 =000 0000 0000 0000 0000 00012
310 =000 0000 0000 0000 0000 00112
For first query
F(4,1) =0
F(3,1) =1
F(5,1) =2
F(6,1) =0
F(1,1) =23
For second query F(4,4) = 23