# [Solution] Two Hundred Twenty One (easy version) solution codeforces

## Two Hundred Twenty One (easy version) solution codeforces

This is the easy version of the problem. The difference between the versions is that the easy version does not require you to output the numbers of the rods to be removed. You can make hacks only if all versions of the problem are solved.

Stitch likes experimenting with different machines with his friend Sparky. Today they built another machine.

The main element of this machine are nn rods arranged along one straight line and numbered from 11 to nn inclusive. Each of these rods must carry an electric charge quantitatively equal to either 11 or 1−1 (otherwise the machine will not work). Another condition for this machine to work is that the sign-variable sum of the charge on all rods must be zero.

More formally, the rods can be represented as an array of nn numbers characterizing the charge: either 11 or 1−1. Then the condition must hold: a1a2+a3a4+=0a1−a2+a3−a4+…=0, or i=1n(1)i1ai=0∑i=1n(−1)i−1⋅ai=0.

Sparky charged all nn rods with an electric current, but unfortunately it happened that the rods were not charged correctly (the sign-variable sum of the charge is not zero). The friends decided to leave only some of the rods in the machine. Sparky has qq questions. In the iith question Sparky asks: if the machine consisted only of rods with numbers lili to riri inclusive, what minimal number of rods could be removed from the machine so that the sign-variable sum of charges on the remaining ones would be zero? Perhaps the friends got something wrong, and the sign-variable sum is already zero. In that case, you don’t have to remove the rods at all.

If the number of rods is zero, we will assume that the sign-variable sum of charges is zero, that is, we can always remove all rods.

Input Two Hundred Twenty One (easy version) solution codeforces

Each test contains multiple test cases.

The first line contains one positive integer tt (1t1031≤t≤103), denoting the number of test cases. Description of the test cases follows.

The first line of each test case contains two positive integers nn and qq (1n,q31051≤n,q≤3⋅105) — the number of rods and the number of questions.

The second line of each test case contains a non-empty string ss of length nn, where the charge of the ii-th rod is 11 if sisi is the “+” symbol, or 1−1 if sisi is the “” symbol.

Each next line from the next qq lines contains two positive integers lili ans riri (1lirin1≤li≤ri≤n) — numbers, describing Sparky’s questions.

It is guaranteed that the sum of nn over all test cases does not exceed 31053⋅105, and the sum of qq over all test cases does not exceed 31053⋅105.

Output Two Hundred Twenty One (easy version) solution codeforces

For each test case, print a single integer — the minimal number of rods that can be removed.

Example Two Hundred Twenty One (easy version) solution codeforces
input

Copy
3
14 1
+--++---++-++-
1 14
14 3
+--++---+++---
1 14
6 12
3 10
4 10
+-+-
1 1
1 2
1 3
1 4
2 2
2 3
2 4
3 3
3 4
4 4

output

Copy
2
2
1
0
1
2
1
2
1
2
1
1
2
1

Note Two Hundred Twenty One (easy version) solution codeforces

In the first test case for the first query you can remove the rods numbered 55 and 88, then the following set of rods will remain: +–+–++-++-. It is easy to see that here the sign-variable sum is zero.

In the second test case:

• For the first query, we can remove the rods numbered 11 and 1111, then the following set of rods will remain: +–+–++-++-. It is easy to see that here the sign-variable sum is zero.
• For the second query we can remove the rod numbered 99, then the following set of rods will remain: —++-. It is easy to see that here the variable sum is zero.
• For the third query we can not remove the rods at all.