#include <bits/stdc++.h>
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=0){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> bool inside(T l,T x,T r){return l<=x&&x<r;}

#include <atcoder/segtree>
using F = array<pair<int, int>, 18>;
int K;
struct S{
    int ans = INF;
    int l = -1;
    int r = -1;
    F dpl, dpr;
};

S op(S l, S r){
    if (l.l == -1) return r;
    if (r.l == -1) return l;
    // upd ans
    chmin(l.ans, r.ans);
    rep(i, 0, 17) rep(j, 0, 17){
        if ((l.dpr[i].first | r.dpl[j].first) == (1 << K) - 1){
            chmin(l.ans, r.dpl[j].second - l.dpr[i].second);
        }
    }
    // upd dpl
    int ind = 0;
    while (l.dpl[ind].second != -1) ind++;
    rep(i, 0, 17) if (r.dpl[i].second != -1){
        if ((l.dpl[ind - 1].first | r.dpl[i].first) != l.dpl[ind - 1].first){
            l.dpl[ind].first = (l.dpl[ind - 1].first | r.dpl[i].first);
            l.dpl[ind].second = r.dpl[i].second;
            ind++;
        }
    }
    // upd dpr
    ind = 0;
    while (r.dpr[ind].second != -1) ind++;
    rep(i, 0, 17) if (l.dpr[i].second != -1){
        if ((r.dpr[ind - 1].first | l.dpr[i].first) != r.dpr[ind - 1].first){
            r.dpr[ind].first = (r.dpr[ind - 1].first | l.dpr[i].first);
            r.dpr[ind].second = l.dpr[i].second;
            ind++;
        }
    }
    l.dpr = r.dpr;
    l.r = r.r;
    return l;
}
S e(){
    S tmp;
    rep(i, 0, 17){
        tmp.dpl[i] = {(1 << 20), -1};
        tmp.dpr[i] = {(1 << 20), -1};
    }
    return tmp;
}

void solve();
// CYAN / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N;
    cin >> N >> K;
    vector<int> A(N);
    rep(i, 0, N) cin >> A[i];
    vector<S> base(N, e());
    rep(i, 0, N){
        base[i].l = i, base[i].r = i + 1;
        base[i].dpl[0] = {A[i], i + 1};
        base[i].dpr[0] = {A[i], i};
        if (A[i] + 1 == (1 << K)) base[i].ans = 1;
    }
    atcoder::segtree<S, op, e> seg(base);
    int Q;
    cin >> Q;
    while (Q--){
        int t, x, y;
        cin >> t >> x >> y;
        if (t == 1){
            x--;
            base[x].dpl[0] = {y, x + 1};
            base[x].dpr[0] = {y, x};
            if (y + 1 == (1 << K)) base[x].ans = 1;
            else base[x].ans = INF;
            seg.set(x, base[x]);
        }
        else{
            x--;
            auto tmp = seg.prod(x, y);
            if (tmp.ans != INF) cout << tmp.ans << "\n";
            else cout << "-1\n";
        }
    }
}