description: 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 n rods arranged along one straight line and numbered from 1 to n inclusive. Each of these rods must carry an electric charge quantitatively equal to either 1 or -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 n numbers characterizing the charge: either 1 or -1. Then the condition must hold: a_1 - a_2 + a_3 - a_4 + … = 0, or ∑_{i=1}^n (-1)^{i-1} ⋅ a_i = 0.
  
  Sparky charged all n 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 q questions. In the ith question Sparky asks: if the machine consisted only of rods with numbers l_i to r_i 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.
  
  Help your friends and answer all of Sparky's questions!
  
  Input
  
  Each test contains multiple test cases.
  
  The first line contains one positive integer t (1 ≤ t ≤ 10^3), denoting the number of test cases. Description of the test cases follows.
  
  The first line of each test case contains two positive integers n and q (1 ≤ n, q ≤ 3 ⋅ 10^5) — the number of rods and the number of questions.
  
  The second line of each test case contains a non-empty string s of length n, where the charge of the i-th rod is 1 if s_i is the "+" symbol, or -1 if s_i is the "-" symbol.
  
  Each next line from the next q lines contains two positive integers l_i ans r_i (1 ≤ l_i ≤ r_i ≤ n) — numbers, describing Sparky's questions.
  
  It is guaranteed that the sum of n over all test cases does not exceed 3 ⋅ 10^5, and the sum of q over all test cases does not exceed 3 ⋅ 10^5.
  
  Output
  
  For each test case, print a single integer — the minimal number of rods that can be removed.
  
  Example
  
  Input
  
  
  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
  
  
  2
  2
  1
  0
  1
  2
  1
  2
  1
  2
  1
  1
  2
  1
  
  Note
  
  In the first test case for the first query you can remove the rods numbered 5 and 8, 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 1 and 11, 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 9, 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. 
solution: import java.io.*;
  import java.util.*;
  
  import static java.lang.Math.*;
  import static java.util.Arrays.*;
  
  public class cf1562d1 {
  
      public static void main(String[] args) throws IOException {
          int t = ri();
          while (t --> 0) {
              int n = rni(), q = ni(), a[] = new int[n], sum[] = new int[n + 1];
              char[] s = rcha();
              for (int i = 0; i < n; ++i) {
                  a[i] = s[i] == '+' ? 1 : -1;
                  if (i % 2 == 1) {
                      a[i] = -a[i];
                  }
                  sum[i + 1] = sum[i] + a[i];
              }
              while (q --> 0) {
                  int l = rni() - 1, r = ni(), d = abs(sum[r] - sum[l]);
                  prln(d == 0 ? 0 : d % 2 == 0 ? 2 : 1);
              }
          }
          close();
      }
  
      static BufferedReader __i = new BufferedReader(new InputStreamReader(System.in));
      static PrintWriter __o = new PrintWriter(new OutputStreamWriter(System.out));
      static StringTokenizer input;
      static Random __r = new Random();
  
      // references
      // IBIG = 1e9 + 7
      // IMAX ~= 2e9
      // LMAX ~= 9e18
  
      // constants
      static final int IBIG = 1000000007;
      static final int IMAX = 2147483647;
      static final long LMAX = 9223372036854775807L;
      // math util
      static int minof(int a, int b, int c) {return min(a, min(b, c));}
      static int minof(int... x) {if (x.length == 1) return x[0]; if (x.length == 2) return min(x[0], x[1]); if (x.length == 3) return min(x[0], min(x[1], x[2])); int min = x[0]; for (int i = 1; i < x.length; ++i) if (x[i] < min) min = x[i]; return min;}
      static long minof(long a, long b, long c) {return min(a, min(b, c));}
      static long minof(long... x) {if (x.length == 1) return x[0]; if (x.length == 2) return min(x[0], x[1]); if (x.length == 3) return min(x[0], min(x[1], x[2])); long min = x[0]; for (int i = 1; i < x.length; ++i) if (x[i] < min) min = x[i]; return min;}
      static int maxof(int a, int b, int c) {return max(a, max(b, c));}
      static int maxof(int... x) {if (x.length == 1) return x[0]; if (x.length == 2) return max(x[0], x[1]); if (x.length == 3) return max(x[0], max(x[1], x[2])); int max = x[0]; for (int i = 1; i < x.length; ++i) if (x[i] > max) max = x[i]; return max;}
      static long maxof(long a, long b, long c) {return max(a, max(b, c));}
      static long maxof(long... x) {if (x.length == 1) return x[0]; if (x.length == 2) return max(x[0], x[1]); if (x.length == 3) return max(x[0], max(x[1], x[2])); long max = x[0]; for (int i = 1; i < x.length; ++i) if (x[i] > max) max = x[i]; return max;}
      static int powi(int a, int b) {if (a == 0) return 0; int ans = 1; while (b > 0) {if ((b & 1) > 0) ans *= a; a *= a; b >>= 1;} return ans;}
      static long powl(long a, int b) {if (a == 0) return 0; long ans = 1; while (b > 0) {if ((b & 1) > 0) ans *= a; a *= a; b >>= 1;} return ans;}
      static int fli(double d) {return (int) d;}
      static int cei(double d) {return (int) ceil(d);}
      static long fll(double d) {return (long) d;}
      static long cel(double d) {return (long) ceil(d);}
      static int gcd(int a, int b) {return b == 0 ? a : gcd(b, a % b);}
      static long gcd(long a, long b) {return b == 0 ? a : gcd(b, a % b);}
      static int[] exgcd(int a, int b) {if (b == 0) return new int[] {1, 0}; int[] y = exgcd(b, a % b); return new int[] {y[1], y[0] - y[1] * (a / b)};}
      static long[] exgcd(long a, long b) {if (b == 0) return new long[] {1, 0}; long[] y = exgcd(b, a % b); return new long[] {y[1], y[0] - y[1] * (a / b)};}
      static int randInt(int min, int max) {return __r.nextInt(max - min + 1) + min;}
      static long mix(long x) {x += 0x9e3779b97f4a7c15L; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9L; x = (x ^ (x >> 27)) * 0x94d049bb133111ebL; return x ^ (x >> 31);}
      // array util
      static void reverse(int[] a) {for (int i = 0, n = a.length, half = n / 2; i < half; ++i) {int swap = a[i]; a[i] = a[n - i - 1]; a[n - i - 1] = swap;}}
      static void reverse(long[] a) {for (int i = 0, n = a.length, half = n / 2; i < half; ++i) {long swap = a[i]; a[i] = a[n - i - 1]; a[n - i - 1] = swap;}}
      static void reverse(double[] a) {for (int i = 0, n = a.length, half = n / 2; i < half; ++i) {double swap = a[i]; a[i] = a[n - i - 1]; a[n - i - 1] = swap;}}
      static void reverse(char[] a) {for (int i = 0, n = a.length, half = n / 2; i < half; ++i) {char swap = a[i]; a[i] = a[n - i - 1]; a[n - i - 1] = swap;}}
      static void shuffle(int[] a) {int n = a.length - 1; for (int i = 0; i < n; ++i) {int ind = randInt(i, n); int swap = a[i]; a[i] = a[ind]; a[ind] = swap;}}
      static void shuffle(long[] a) {int n = a.length - 1; for (int i = 0; i < n; ++i) {int ind = randInt(i, n); long swap = a[i]; a[i] = a[ind]; a[ind] = swap;}}
      static void shuffle(double[] a) {int n = a.length - 1; for (int i = 0; i < n; ++i) {int ind = randInt(i, n); double swap = a[i]; a[i] = a[ind]; a[ind] = swap;}}
      static void rsort(int[] a) {shuffle(a); sort(a);}
      static void rsort(long[] a) {shuffle(a); sort(a);}
      static void rsort(double[] a) {shuffle(a); sort(a);}
      static int[] copy(int[] a) {int[] ans = new int[a.length]; for (int i = 0; i < a.length; ++i) ans[i] = a[i]; return ans;}
      static long[] copy(long[] a) {long[] ans = new long[a.length]; for (int i = 0; i < a.length; ++i) ans[i] = a[i]; return ans;}
      static double[] copy(double[] a) {double[] ans = new double[a.length]; for (int i = 0; i < a.length; ++i) ans[i] = a[i]; return ans;}
      static char[] copy(char[] a) {char[] ans = new char[a.length]; for (int i = 0; i < a.length; ++i) ans[i] = a[i]; return ans;}
      // input
      static void r() throws IOException {input = new StringTokenizer(rline());}
      static int ri() throws IOException {return Integer.parseInt(rline());}
      static long rl() throws IOException {return Long.parseLong(rline());}
      static double rd() throws IOException {return Double.parseDouble(rline());}
      static int[] ria(int n) throws IOException {int[] a = new int[n]; r(); for (int i = 0; i < n; ++i) a[i] = ni(); return a;}
      static void ria(int[] a) throws IOException {int n = a.length; r(); for (int i = 0; i < n; ++i) a[i] = ni();}
      static int[] riam1(int n) throws IOException {int[] a = new int[n]; r(); for (int i = 0; i < n; ++i) a[i] = ni() - 1; return a;}
      static void riam1(int[] a) throws IOException {int n = a.length; r(); for (int i = 0; i < n; ++i) a[i] = ni() - 1;}
      static long[] rla(int n) throws IOException {long[] a = new long[n]; r(); for (int i = 0; i < n; ++i) a[i] = nl(); return a;}
      static void rla(long[] a) throws IOException {int n = a.length; r(); for (int i = 0; i < n; ++i) a[i] = nl();}
      static double[] rda(int n) throws IOException {double[] a = new double[n]; r(); for (int i = 0; i < n; ++i) a[i] = nd(); return a;}
      static void rda(double[] a) throws IOException {int n = a.length; r(); for (int i = 0; i < n; ++i) a[i] = nd();}
      static char[] rcha() throws IOException {return rline().toCharArray();}
      static void rcha(char[] a) throws IOException {int n = a.length, i = 0; for (char c : rline().toCharArray()) a[i++] = c;}
      static String rline() throws IOException {return __i.readLine();}
      static String n() {return input.nextToken();}
      static int rni() throws IOException {r(); return ni();}
      static int ni() {return Integer.parseInt(n());}
      static long rnl() throws IOException {r(); return nl();}
      static long nl() {return Long.parseLong(n());}
      static double rnd() throws IOException {r(); return nd();}
      static double nd() {return Double.parseDouble(n());}
      // output
      static void pr(int i) {__o.print(i);}
      static void prln(int i) {__o.println(i);}
      static void pr(long l) {__o.print(l);}
      static void prln(long l) {__o.println(l);}
      static void pr(double d) {__o.print(d);}
      static void prln(double d) {__o.println(d);}
      static void pr(char c) {__o.print(c);}
      static void prln(char c) {__o.println(c);}
      static void pr(char[] s) {__o.print(new String(s));}
      static void prln(char[] s) {__o.println(new String(s));}
      static void pr(String s) {__o.print(s);}
      static void prln(String s) {__o.println(s);}
      static void pr(Object o) {__o.print(o);}
      static void prln(Object o) {__o.println(o);}
      static void prln() {__o.println();}
      static void pryes() {prln("yes");}
      static void pry() {prln("Yes");}
      static void prY() {prln("YES");}
      static void prno() {prln("no");}
      static void prn() {prln("No");}
      static void prN() {prln("NO");}
      static boolean pryesno(boolean b) {prln(b ? "yes" : "no"); return b;};
      static boolean pryn(boolean b) {prln(b ? "Yes" : "No"); return b;}
      static boolean prYN(boolean b) {prln(b ? "YES" : "NO"); return b;}
      static void prln(int... a) {for (int i = 0, len = a.length - 1; i < len; pr(a[i]), pr(' '), ++i); if (a.length > 0) prln(a[a.length - 1]); else prln();}
      static void prln(long... a) {for (int i = 0, len = a.length - 1; i < len; pr(a[i]), pr(' '), ++i); if (a.length > 0) prln(a[a.length - 1]); else prln();}
      static void prln(double... a) {for (int i = 0, len = a.length - 1; i < len; pr(a[i]), pr(' '), ++i); if (a.length > 0) prln(a[a.length - 1]); else prln();}
      static <T> void prln(Collection<T> c) {int n = c.size() - 1; Iterator<T> iter = c.iterator(); for (int i = 0; i < n; pr(iter.next()), pr(' '), ++i); if (n >= 0) prln(iter.next()); else prln();}
      static void h() {prln("hlfd"); flush();}
      static void flush() {__o.flush();}
      static void close() {__o.close();}
  }