Problem: Sarah has always been a lover of nature, and a couple of years ago she saved up enough money to travel the world and explore all the things built by nature over its lifetime on earth. During this time she visited some truly special places which were left untouched for centuries, from watching icebergs in freezing weather to scuba-diving in oceans and admiring the sea life, residing unseen. These experiences were enhanced with breathtaking views built by mountains over time and left there for visitors to see for years on end. Over time, all these expeditions took a toll on Sarah and culminated in her decision to settle down in the suburbs and live a quiet life. 

However, as Sarah's love for nature never faded, she started growing flowers in her garden in an attempt to stay connected with nature. At the beginning she planted only blue orchids, but over time she started using different flower types to add variety to her collection of flowers. This collection of flowers can be represented as an array of N flowers and the i-th of them has a type associated with it, denoted as A_i. Each resident, passing by her collection and limited by the width of his view, can only see K contiguous flowers at each moment in time. To see the whole collection, the resident will look at the first K contiguous flowers A_1, A_2, ..., A_K, then shift his view by one flower and look at the next section of K contiguous flowers A_2, A_3, ..., A_{K+1} and so on until they scan the whole collection, ending with section A_{N-K+1}, ..., A_{N-1}, A_N.

Each resident determines the beautiness of a section of K flowers as the number of distinct flower types in that section. Furthermore, the beautiness of the whole collection is calculated by summing the beautiness values of each contiguous section. Formally, beautiness B_i of a section starting at the i-th position is calculated as B_i = distinct(A_i, A_{i+1}, ..., A_{i+K-1}), and beautiness of the collection B is calculated as B=B_1 + B_2 + ... + B_{N-K+1}.

In addition, as Sarah wants to keep her collection of flowers have a fresh feel, she can also pick two points L and R, dispose flowers between those two points and plant new flowers, all of them being the same type.

You will be given Q queries and each of those queries will be of the following two types: 

  1. You will be given three integers L, R, X describing that Sarah has planted flowers of type X between positions L and R inclusive. Formally collection is changed such that A[i]=X for all i in range [L.. R]. 
  2. You will be given integer K, width of the resident's view and you have to determine the beautiness value B resident has associated with the collection 



For each query of second type print the result – beautiness B of the collection.

Input

First line contains two integers N and Q \;(1 ≤ N, Q ≤ 10^5)  — number of flowers and the number of queries, respectively.

The second line contains N integers A_1, A_2, ..., A_N\;(1 ≤ A_i ≤ 10^9)  — where A_i represents type of the i-th flower.

Each of the next Q lines describe queries and start with integer T∈\{1, 2\}. 

  * If T = 1, there will be three more integers in the line L, R, X\;(1 ≤ L, R ≤ N;\; 1 ≤ X ≤ 10^9)  — L and R describing boundaries and X describing the flower type 
  * If T = 2, there will be one more integer in the line K\;(1 ≤ K ≤ N)  — resident's width of view 

Output

For each query of the second type print the beautiness B of the collection.

Example

Input


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


Output


9
6
4

Note

Let's look at the example.

Initially the collection is [1, 2, 3, 4, 5]. In the first query K = 3, we consider sections of three flowers with the first being [1, 2, 3]. Since beautiness of the section is the number of distinct flower types in that section, B_1 = 3. Second section is [2, 3, 4] and B_2 = 3. Third section is [3, 4, 5] and B_3 = 3, since the flower types are all distinct. The beautiness value resident has associated with the collection is B = B_1 + B_2 + B_3 = 3 + 3 + 3 = 9.

After the second query, the collection becomes [5, 5, 3, 4, 5]. 

For the third query K = 4, so we consider sections of four flowers with the first being [5, 5, 3, 4]. There are three distinct flower types [5, 3, 4] in this section, so B_1 = 3. Second section [5, 3, 4, 5] also has 3 distinct flower types, so B_2 = 3. The beautiness value resident has associated with the collection is B = B_1 + B_2 = 3 + 3 = 6

After the fourth query, the collection becomes [5, 5, 5, 5, 5].

For the fifth query K = 2 and in this case all the four sections are same with each of them being [5, 5]. Beautiness of [5, 5] is 1 since there is only one distinct element in this section [5]. Beautiness of the whole collection is B = B_1 + B_2 + B_3 + B_4 = 1 + 1 + 1 + 1 = 4

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 200005;
int n, m, ct, a[Maxn], b[Maxn], x[Maxn], y[Maxn], opt[Maxn], val[Maxn];
set<pair<int, int> > Se[Maxn];
struct ele {
  int lt, rt, val;
  bool operator<(const ele &A) const { return lt < A.lt; }
};
set<ele> S;
struct Tree {
  int lt, rt;
  pair<int, long long> tag;
} tree[4 * Maxn];
void build(int root, int lt, int rt) {
  tree[root] = (Tree){lt, rt, make_pair(0, 0)};
  if (lt + 1 != rt) {
    int mid = (lt + rt) >> 1;
    build(root << 1, lt, mid);
    build(root << 1 | 1, mid, rt);
  }
}
pair<int, long long> operator+(const pair<int, long long> &A,
                               const pair<int, long long> &B) {
  return make_pair(A.first + B.first, A.second + B.second);
}
void pushdown(int root) {
  tree[root << 1].tag = tree[root << 1].tag + tree[root].tag;
  tree[root << 1 | 1].tag = tree[root << 1 | 1].tag + tree[root].tag;
  tree[root].tag = make_pair(0, 0);
}
void modify(int root, int lt, int rt, pair<int, long long> val) {
  lt = max(lt, 1);
  if (lt >= rt) return;
  if (tree[root].lt == lt && tree[root].rt == rt)
    tree[root].tag = tree[root].tag + val;
  else {
    pushdown(root);
    int mid = (tree[root].lt + tree[root].rt) >> 1;
    if (lt >= mid)
      modify(root << 1 | 1, lt, rt, val);
    else if (rt <= mid)
      modify(root << 1, lt, rt, val);
    else
      modify(root << 1, lt, mid, val), modify(root << 1 | 1, mid, rt, val);
  }
}
long long ask(int root, int pos) {
  if (tree[root].lt + 1 == tree[root].rt)
    return tree[root].tag.first * (long long)tree[root].lt +
           tree[root].tag.second;
  else {
    pushdown(root);
    int mid = (tree[root].lt + tree[root].rt) >> 1;
    if (pos >= mid)
      return ask(root << 1 | 1, pos);
    else
      return ask(root << 1, pos);
  }
}
void work(int u, int lt, int rt, int val) {
  int las = (--Se[u].lower_bound(make_pair(lt, 0)))->second + 1,
      nxt = Se[u].upper_bound(make_pair(rt, 0x3f3f3f3f))->first - 1;
  modify(1, 1, min(lt - las + 1, nxt - rt + 1) + 1,
         make_pair(val, (rt - lt) * val));
  modify(1, nxt - rt + 2, lt - las + 2, make_pair(0, (nxt - lt + 1) * val));
  modify(1, lt - las + 2, nxt - rt + 2, make_pair(0, (rt - las + 1) * val));
  modify(1, max(lt - las + 2, nxt - rt + 2), nxt - las + 2,
         make_pair(-val, (nxt - las + 2) * val));
}
set<pair<int, int> >::iterator spilt(int u, int x) {
  set<pair<int, int> >::iterator it =
      --Se[u].lower_bound(make_pair(x, 0x3f3f3f3f));
  pair<int, int> now = *it;
  if (it->first == x) return it;
  if (it->second < x) return ++it;
  Se[u].erase(it);
  Se[u].insert(make_pair(now.first, x - 1));
  return Se[u].insert(make_pair(x, now.second)).first;
}
void erase(int lt, int rt, int u) {
  set<pair<int, int> >::iterator it_r = spilt(u, rt + 1), it_l = spilt(u, lt);
  for (auto it = it_l; it != it_r;) {
    work(u, it->first, it->second, -1);
    it = Se[u].erase(it);
  }
}
set<ele>::iterator spilt(int x) {
  if (x > n) return S.end();
  set<ele>::iterator it = --S.upper_bound((ele){x, 0, 0});
  if (it->lt == x) return it;
  ele now = *it;
  S.erase(it);
  S.insert((ele){now.lt, x - 1, now.val});
  return S.insert((ele){x, now.rt, now.val}).first;
}
void erase(int lt, int rt) {
  set<ele>::iterator it_r = spilt(rt + 1), it_l = spilt(lt);
  for (auto it = it_l; it != it_r; it++) erase(it->lt, it->rt, it->val);
  S.erase(it_l, it_r);
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]), b[++ct] = a[i];
  for (int i = 1; i <= m; i++) {
    scanf("%d", &opt[i]);
    if (opt[i] == 1)
      scanf("%d%d%d", &x[i], &y[i], &val[i]), b[++ct] = val[i];
    else
      scanf("%d", &val[i]);
  }
  sort(b + 1, b + 1 + ct);
  ct = unique(b + 1, b + 1 + ct) - b - 1;
  for (int i = 1; i <= ct; i++)
    Se[i].insert(make_pair(0, 0)), Se[i].insert(make_pair(n + 1, n + 1));
  build(1, 1, n + 1);
  for (int i = 1; i <= n; i++) {
    a[i] = lower_bound(b + 1, b + 1 + ct, a[i]) - b;
    work(a[i], i, i, 1);
    Se[a[i]].insert(make_pair(i, i));
    S.insert((ele){i, i, a[i]});
  }
  for (int i = 1; i <= m; i++)
    if (opt[i] == 1) {
      val[i] = lower_bound(b + 1, b + 1 + ct, val[i]) - b;
      erase(x[i], y[i]);
      S.insert((ele){x[i], y[i], val[i]});
      work(val[i], x[i], y[i], 1);
      Se[val[i]].insert(make_pair(x[i], y[i]));
    } else
      printf("%lld\n", ask(1, val[i]));
  return 0;
}