You are given a binary string $$$s$$$ of length $$$n$$$ and must process $$$q$$$ operations of the following types:
There is only one test case in each test file.
The first line contains two integers $$$n$$$ and $$$q$$$ ($$$1 \le n,q \le 2 \cdot 10^5$$$).
The second line contains a binary string $$$s$$$ of length $$$n$$$.
Each of the next $$$q$$$ lines contains three integers $$$t$$$, $$$l$$$, and $$$r$$$ ($$$t \in \{1,2\}$$$, $$$1 \le l \le r \le n$$$), describing an operation.
It is guaranteed that there is at least one operation of type 2.
For each operation of type 2, print one integer — the maximum possible absolute difference between the number of characters 1 and the number of characters 0 in the remaining string.
5 5110102 1 51 2 42 1 52 2 42 3 3
2 2 2 1
4 301012 1 41 1 42 1 4
1 1
In the first example:
| Name |
|---|


