Appleman has a very big sheet of paper. This sheet has a form of rectangle with dimensions 1 × n. Your task is help Appleman with folding of such a sheet. Actually, you need to perform q queries. Each query will have one of the following types:

1. Fold the sheet of paper at position p_i. After this query the leftmost part of the paper with dimensions 1 × p_i must be above the rightmost part of the paper with dimensions 1 × ([current width of sheet] - p_i).
2. Count what is the total width of the paper pieces, if we will make two described later cuts and consider only the pieces between the cuts. We will make one cut at distance l_i from the left border of the current sheet of paper and the other at distance r_i from the left border of the current sheet of paper.

Please look at the explanation of the first test example for better understanding of the problem.

The first line contains two integers: n and q (1  ≤ n ≤ 10⁵; 1 ≤ q ≤ 10⁵) — the width of the paper and the number of queries.

Each of the following q lines contains one of the described queries in the following format:

• "1 p_i" (1 ≤ p_i < [current width of sheet]) — the first type query.
• "2 l_i r_i" (0 ≤ l_i < r_i ≤ [current width of sheet]) — the second type query.

For each query of the second type, output the answer.