#include <bits/stdc++.h>
using namespace std;

struct Queue{
    std::vector<int> fsum,bval;
    int ftop=0,bsum=0;
    void reserve(int n){
        fsum.reserve(n);
        bval.reserve(n);
    }
    void push(int x){
        bsum|=x;
        bval.push_back(x);
    }
    void pop(){
        if(fsum.empty()){
            for(auto it=bval.rbegin();it!=bval.rend();++it){
                ftop|=*it;
                fsum.push_back(ftop);
            }
            bval.clear();
            bsum=0;
        }
        fsum.pop_back();
        ftop=fsum.empty()?0:fsum.back();
    }
    void clear(){
        fsum.clear();
        bval.clear();
        ftop=0;
        bsum=0;
    }
    int sum() const{
        return ftop|bsum;
    }
};

int main(){
    int n,k,q;
    cin>>n>>k;
    int full=(1<<k)-1;
    vector<int> a(n);
    for(int &x:a)
        cin>>x;
    Queue que;
    que.reserve(n);
    cin>>q;
    while(q--){
        int t,l,r;
        cin>>t>>l>>r;
        if(t==1){
            a[l-1]=r;
        }else{
            int ans=INT_MAX,j=l-1;
            for(int i=l-1;i<r;i++){
                while(j<r&&que.sum()!=full){
                    que.push(a[j]);
                    j++;
                }
                if(que.sum()==full){
                    ans=min(ans,j-i);
                    que.pop();
                }else{
                    que.clear();
                    break;
                }
            }
            cout<<(ans==INT_MAX?-1:ans)<<'\n';
        }
    }
}