#include <bits/stdc++.h>

using namespace std;

ifstream fin("aib.in");
ofstream fout("aib.out");

int n, m;

/// ret cea mai din stnga pozitie p cu a1+a2+...+an = S
int CautaPoz(int s)
{
    int st, dr, mid, p, suma;
    p = -1;
    st = 1;
    dr = n;
    while(st <= dr)
    {
        mid = (st + dr) / 2;
        suma = Query(mid);
        if(suma == s)
        {
            p = mid;
            dr = mid - 1;
        }
        else if(suma > s) dr = mid - 1;
        else st = mid + 1;
    }
    return p;
}

int Query(int p)
{
    int s = 0, cnt = 0;
    while(p  > 0)
    {
        s |= aib[p];
        p -= (p & (-p));
    }
    while(s > 0)
    {
        cnt++;
        s = s & (s - 1);
    }
    return cnt;
}

void Update(int p, int x)
{
    while(p <= n)
    {
        aib[p] = aib[p] | (1 << x);
        p += (p & (-p));
    }
}

int main()
{
    int i,x;
    fin >> n >> m;
    for(i = 1; i <= n; i++)
    {
        fin >> x;
        Update(i,x);
    }
    for(i = 1; i <= m; i++)
    {
        fin >> op;
        if(op == 0)
        {
            fin >> x >> y;
            Update(x, y);
        }
        else if(op == 1)
        {
            fin >> x >> y;
            fout << Query(y) - Query(x - 1) << "\n";
        }
        else
        {
            fin >> x;
            fout << CautaPoz(x)<< "\n";
        }
    }
    return 0;
}