CF896E.Welcome home, Chtholly

— I... I survived.

— Welcome home, Chtholly.

— I kept my promise...

— I made it... I really made it!

After several days of fighting, Chtholly Nota Seniorious miraculously returned from the fierce battle.

As promised, Willem is now baking butter cake for her.

However, although Willem is skilled in making dessert, he rarely bakes butter cake.

This time, Willem made a big mistake — he accidentally broke the oven!

Fortunately, Chtholly decided to help him.

Willem puts n cakes on a roll, cakes are numbered from 1 to n, the i-th cake needs a__i seconds of baking.

Willem needs Chtholly to do m operations to bake the cakes.

Operation 1: 1 l r x

Willem asks Chtholly to check each cake in the range [l, r], if the cake needs to be baked for more than x seconds, he would bake it for x seconds and put it back in its place. More precisely, for every i in range [l, r], if a__i is strictly more than x, a__i becomes equal a__i - x.

Operation 2: 2 l r x

Willem asks Chtholly to count the number of cakes in the range [l, r] that needs to be cooked for exactly x seconds. More formally you should find number of such i in range [l, r], that a__i = x.

— 我……我活下来了。

— 欢迎回家，克洛蒂尔德。

— 我信守了我的承诺……

— 我成功了……我真的成功了！

经过数日激战，克洛蒂尔德·诺塔·塞尼奥里乌斯奇迹般地从惨烈的战斗中生还归来。

如约而至，威尔莱姆此刻正在为她烘焙黄油蛋糕。

然而，尽管威尔莱姆精于制作甜点，却极少烘焙黄油蛋糕。

这一次，威尔莱姆犯了一个大错——他不小心把烤箱弄坏了！

所幸，克洛蒂尔德决定出手相助。

威尔莱姆将 $n$ 个蛋糕排成一列，蛋糕编号为 $1$ 到 $n$，其中第 $i$ 个蛋糕需要烘焙 $a_i$ 秒。

威尔莱姆需要克洛蒂尔德执行 $m$ 个操作来完成蛋糕的烘焙。

操作 1：1 l r x
威尔莱姆请克洛蒂尔德检查区间 $[l,\,r]$ 内的每个蛋糕；若某个蛋糕所需烘焙时间严格大于 $x$ 秒，则将其烘焙 $x$ 秒后放回原位。更准确地说，对每个 $i \in [l,\,r]$，若 $a_i > x$，则令 $a_i \gets a_i - x$。

操作 2：2 l r x
威尔莱姆请克洛蒂尔德统计区间 $[l,\,r]$ 内所需烘焙时间恰好为 $x$ 秒的蛋糕数量。更正式地，你需要找出满足 $i \in [l,\,r]$ 且 $a_i = x$ 的下标 $i$ 的个数。

The first line contains two integers n and m (1 ≤ n, m ≤ 105).

The second line contains n integers, i-th of them is a__i (1 ≤ a__i ≤ 105).

The next m lines are the m operations described above. It is guaranteed that 1 ≤ l ≤ r ≤ n and 1 ≤ x ≤ 105.

第一行包含两个整数 $n$ 和 $m$（$1 \leq n, m \leq 10^5$）。

第二行包含 $n$ 个整数，其中第 $i$ 个为 $a_i$（$1 \leq a_i \leq 10^5$）。

接下来的 $m$ 行描述上述 $m$ 个操作。保证 $1 \leq l \leq r \leq n$ 且 $1 \leq x \leq 10^5$。

For each operation of the second type, print the answer.

对于每种第二类操作，输出答案。