Question

Ben likes substrings and he can choose any substrings from S. A
substring is a contiguous sequence of characters within a string.
However, he can only choose a substring if the substring he
selects starts with 'l'and the equivalent decimal value of the
binary substring lies between Land Rinclusive.
You need to find out the number of ways in which Ben can
choose a substring from the given string.
= = 5
= N = 100000
1<=LR<= 1019
String consists of only characters 0 and 1
Input Format
The first line contains a single integer T, the number of test
Cases
Light
For each test case:
Recline contains a single integer Nthe length of the​

Answer 1

$< \beta \beta ln( \alpha \cos( \sec( \infty \%yx = = 698)( {. = cswjo}b}^{2} \times \frac{?}{?} ) ) )$