#include <bits/stdc++.h> using namespace std; const int MAXN = 8005; int a[MAXN]; set<int> s; int main() { int n, m; cin >> n >> m; for (int i = 1; i <= n; ++i) { cin >> a[i]; } while (m--) { int t, l, r, c, cnt = 0; cin >> t; if (t > 1) { cin >> l >> r; s.clear(); for (int i = l; i <= r; ++i) { s.insert(a[i]); } cout << s.size() << '\n'; } else { cin >> l >> r >> c; for (int i = l; i <= r; ++i) { a[i] = c; } } } return 0; }