Meow~ Meow~ Meow~

Problem Description

Little C owns $n$ cats numbered from $1$ to $n$. Little C does not like feeding just one cat at a time, so each time he feeds a contiguous range of cats $[l, r]$, and every feeding uses a different kind of cat food. There are $m$ operations in total; each operation gives $op, l, r$.

• If $op = 1$, Little C feeds the cats with indices in $[l, r]$ once.
• If $op = 2$, this is a query: output the total number of different kinds of cat food eaten by the cats with indices in $[l, r]$.

Input Format

The first line contains two integers $n, m$.

The next $m$ lines each contain three integers $op, l, r$.

Output Format

For each query, output one line containing a single integer: the answer.

Sample Input

5 4
1 1 1
1 2 2
2 1 1
2 1 2

Sample Output

1
2

Constraints

$0 \le n, m \le 100000$, $1 \le l \le r \le n$.