#line 1 "template/template.hpp"
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
#endif

using namespace std;

using int64 = long long;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;

template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << p.first << " " << p.second;
  return os;
}

template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &in : v) is >> in;
  return is;
}

template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}

template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}

template<typename T = int64>
vector<T> make_v(size_t a) {
  return vector<T>(a);
}

template<typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template<typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
  t = v;
}

template<typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
  for (auto &e : t) fill_v(e, v);
}

template<typename F>
struct FixPoint : F {
  explicit FixPoint(F &&f) : F(std::forward<F>(f)) {}

  template<typename... Args>
  decltype(auto) operator()(Args &&...args) const {
    return F::operator()(*this, std::forward<Args>(args)...);
  }
};

template<typename F>
inline decltype(auto) MFP(F &&f) {
  return FixPoint<F>{std::forward<F>(f)};
}

#line 1 "structure/others/queue-operate-aggregation.hpp"
template <typename T, typename F>
struct QueueOperateAggregation {
 private:
  struct Node {
    T val, sum;

    Node(const T& val, const T& sum) : val(val), sum(sum) {}
  };
  const F f;
  vector<Node> st[2];

 public:
  QueueOperateAggregation() = default;

  explicit QueueOperateAggregation(F f) : f(f) {}

  bool empty() const { return st[0].empty() and st[1].empty(); }

  size_t size() const { return st[0].size() + st[1].size(); }

  T all_prod() const {
    assert(not empty());
    if (st[0].empty()) {
      return st[1].back().sum;
    } else if (st[1].empty()) {
      return st[0].back().sum;
    } else {
      return f(st[0].back().sum, st[1].back().sum);
    }
  }

  void push(const T& x) {
    if (st[1].empty()) {
      st[1].emplace_back(x, x);
    } else {
      st[1].emplace_back(x, f(st[1].back().sum, x));
    }
  }

  void pop() {
    assert(not empty());
    if (st[0].empty()) {
      st[0].emplace_back(st[1].back().val, st[1].back().val);
      st[1].pop_back();
      while (not st[1].empty()) {
        st[0].emplace_back(st[1].back().val,
                           f(st[1].back().val, st[0].back().sum));
        st[1].pop_back();
      }
    }
    st[0].pop_back();
  }
  void clear() {
    st[0].clear();
    st[1].clear();
  }
};

template <typename T, typename F>
QueueOperateAggregation<T, F> get_queue_operate_aggregation(const F& f) {
  return QueueOperateAggregation<T, F>{f};
}



int main() {
  int N, K;
  cin >> N >> K;
  vector< int > A(N);
  cin >> A;
  auto f = [&](int a, int b) {
    return a | b;
  };
  int Q;
  cin >> Q;
  auto que = get_queue_operate_aggregation< int >(f);
  while(Q--) {
    int k, a, b;
    cin >> k >> a >> b;
    --a;
    if(k == 1) {
      A[a] = b;
    } else {
      int p = a, ret = inf;
      for(int i = a; i < b; i++) {
        while (p < b and (que.empty() or que.all_prod() != (1 << K) - 1)) {
          que.push(A[p]);
          ++p;
        }
        if (que.all_prod() == (1 << K) - 1) {
          chmin(ret, p - i);
        } else {
          break;
        }
        que.pop();
      }
      if(ret == inf) ret = -1;
      cout << ret << endl;
      que.clear();
    }
  }
}