#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif

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

using ll = long long;            // 2^63-1まで 負の値は可
using ull = unsigned long long;  // 0<= ull <=2^64-1の範囲 負の値は不可
using vl = vector<ll>;
using vvl = vector<vl>;
using P = pair<ll, ll>;
template <typename T>
using MNPQ = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
using MXPQ = priority_queue<T, vector<T>, less<T>>;

#define rep(i, n) for (int i = 0; i < n; i++)
#define srep(i, s, n) for (int i = s; i < n; i++)
#define rrep(i, s, n) for (int i = s; i > n; i--)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define nall(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define vunique(v) v.erase(unique(nall(v)), v.end())
#define IN(a, x) find(nall(a), x) != a.end()
#define YN(flg) cout << (flg ? "Yes" : "No") << "\n"
#define out_grid(x, y, h, w) !(0 <= x && x < h && 0 <= y && y < w)
#define lmd(...) [&](__VA_ARGS__)
#define debug(x) cerr << #x << " = " << x << endl;
const ll INF = 2e18;

template <typename T>
istream& operator>>(istream& is, vector<T>& a) {
    for (auto& x : a) is >> x;
    return is;
}

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

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

template <typename K, typename V>
ostream& operator<<(ostream& os, map<K, V>& a) {
    for (auto& [k, v] : a) os << "{key:" << k << ", item:" << v << "} ";
    return os;
}

ll op(ll a, ll b) { return max(a, b); }
ll e() { return -INF; }

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    ll n, q;
    cin >> n >> q;
    segtree<ll, op, e> seg(n);
    rep(i, n) {
        ll a;
        cin >> a;
        seg.set(i, a);
    }

    while (q--) {
        ll c, x;
        cin >> c >> x;
        if (c == 1) {
            ll lw = 0, hi = n - 1;
            while (hi - lw) {
                ll mid = (hi + lw) / 2;
                ll num = seg.prod(lw, mid + 1);
                if (num > x)
                    hi = mid;
                else
                    lw = mid + 1;
            }

            if (seg.prod(lw, hi + 1) > x) {
                cout << hi + 1 << endl;
                seg.set(lw, -INF);
            } else {
                cout << -1 << endl;
            }

        } else {
            ll lw = 0, hi = n - 1;
            while (hi - lw > 1) {
                ll mid = (hi + lw) / 2;
                ll num = seg.prod(mid, hi);
                if (num > x)
                    lw = mid;
                else
                    hi = mid;
            }
            if (seg.prod(lw, hi) > x) {
                cout << hi << endl;
                seg.set(lw, -INF);
            } else {
                cout << -1 << endl;
            }
        }
    }

    return 0;
}