#include <bits/stdc++.h>

#include <algorithm>
#include <cassert>
#include <vector>


#ifdef _MSC_VER
#include <intrin.h>
#endif

namespace atcoder {

namespace internal {

int ceil_pow2(int n) {
    int x = 0;
    while ((1U << x) < (unsigned int)(n)) x++;
    return x;
}

constexpr int bsf_constexpr(unsigned int n) {
    int x = 0;
    while (!(n & (1 << x))) x++;
    return x;
}

int bsf(unsigned int n) {
#ifdef _MSC_VER
    unsigned long index;
    _BitScanForward(&index, n);
    return index;
#else
    return __builtin_ctz(n);
#endif
}

}  // namespace internal

}  // namespace atcoder


namespace atcoder {

template <class S, S (*op)(S, S), S (*e)()> struct segtree {
  public:
    segtree() : segtree(0) {}
    explicit segtree(int n) : segtree(std::vector<S>(n, e())) {}
    explicit segtree(const std::vector<S>& v) : _n(int(v.size())) {
        log = internal::ceil_pow2(_n);
        size = 1 << log;
        d = std::vector<S>(2 * size, e());
        for (int i = 0; i < _n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) {
            update(i);
        }
    }

    void set(int p, S x) {
        assert(0 <= p && p < _n);
        p += size;
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }

    S get(int p) const {
        assert(0 <= p && p < _n);
        return d[p + size];
    }

    S prod(int l, int r) const {
        assert(0 <= l && l <= r && r <= _n);
        S sml = e(), smr = e();
        l += size;
        r += size;

        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }
        return op(sml, smr);
    }

    S all_prod() const { return d[1]; }

    template <bool (*f)(S)> int max_right(int l) const {
        return max_right(l, [](S x) { return f(x); });
    }
    template <class F> int max_right(int l, F f) const {
        assert(0 <= l && l <= _n);
        assert(f(e()));
        if (l == _n) return _n;
        l += size;
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!f(op(sm, d[l]))) {
                while (l < size) {
                    l = (2 * l);
                    if (f(op(sm, d[l]))) {
                        sm = op(sm, d[l]);
                        l++;
                    }
                }
                return l - size;
            }
            sm = op(sm, d[l]);
            l++;
        } while ((l & -l) != l);
        return _n;
    }

    template <bool (*f)(S)> int min_left(int r) const {
        return min_left(r, [](S x) { return f(x); });
    }
    template <class F> int min_left(int r, F f) const {
        assert(0 <= r && r <= _n);
        assert(f(e()));
        if (r == 0) return 0;
        r += size;
        S sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!f(op(d[r], sm))) {
                while (r < size) {
                    r = (2 * r + 1);
                    if (f(op(d[r], sm))) {
                        sm = op(d[r], sm);
                        r--;
                    }
                }
                return r + 1 - size;
            }
            sm = op(d[r], sm);
        } while ((r & -r) != r);
        return 0;
    }

  private:
    int _n, size, log;
    std::vector<S> d;

    void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
};

}  // namespace atcoder

using namespace std;

struct Milestone{
    int len=0,sum=0;
    bool empty() const{
        return len==0;
    }
};

constexpr int K=24;
using Road=array<Milestone,K>;

void merge_road(Road& me,int len,const Road& append){
    int i=0,j=0;
    while(i<K&&me[i].empty())
        i++;
    while(i<K){
        int prvsum=i==0?0:me[i-1].sum;
        while(j<K&&!append[j].empty()&&(append[j].sum|prvsum)==prvsum)
            j++;
        if(j>=K||append[j].empty())
            break;
        me[i].len=len+append[j].len;
        me[i].sum=prvsum|append[j].sum;
        i++;
        j++;
    }
}

int mask;

int find_ans(const Road& m2l,const Road& m2r){
    int i=K-1,j=0,ans=INT_MAX;
    while(i>=0&&m2l[i].empty())
        i--;
    while(i>=0){
        while(j<K&&!m2r[j].empty()&&(m2l[i].sum|m2r[j].sum)==mask){
            ans=min(ans,m2l[i].len+m2r[j].len);
            j++;
        }
        if(j>=K||m2r[j].empty())
            break;
        i--;
    }
    return ans;
}

struct S{
    S():len(0),ans(INT_MAX),l2r({}),r2l({}){}
    S(int x):len(1),ans(x==mask?1:INT_MAX),l2r(x==0?Road{}:Road{Milestone{.len=1,.sum=x}}),r2l(x==0?Road{}:Road{Milestone{.len=1,.sum=x}}){}
    int len,ans;
    Road l2r,r2l;
};

S op(S x,S y){
    S ret;
    ret.len=x.len+y.len;
    ret.ans=min({x.ans,y.ans,find_ans(x.r2l,y.l2r)});
    ret.l2r=x.l2r;
    merge_road(ret.l2r,x.len,y.l2r);
    ret.r2l=y.r2l;
    merge_road(ret.r2l,y.len,x.r2l);
    return ret;
}

S e(){
    return S();
}

int main(){
    int n,k,q;
    cin>>n>>k;
    mask=(1<<k)-1;
    vector<S> init;
    init.reserve(n);
    for(int i=0;i<n;i++){
        int x;
        cin>>x;
        init.emplace_back(x);
    }
    atcoder::segtree<S,op,e> tree(init);
    cin>>q;
    while(q--){
        int typ,op1,op2;
        cin>>typ>>op1>>op2;
        if(typ==1){
            tree.set(op1-1,S(op2));
        }else{
            int ans=tree.prod(op1-1,op2).ans;
            cout<<(ans==INT_MAX?-1:ans)<<'\n';
        }
    }
}