#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("cautbin.in");
ofstream cout("cautbin.out");
const int DIM = 100001;
struct nr
{
    int nr, ind;
} sir[DIM];
bool cmp(nr a, nr b)
{
    return a.nr < b.nr;
}
int n;
int c1(int k);
int c2(int k);
int c3(int k);
int main()
{
    int m;
    cin >> n;
    for(int i = 1; i <= n; ++i)
    {
        cin >> sir[i].nr;
        sir[i].ind = i;
    }

    sort(sir + 1, sir + n + 1, cmp);

    cin >> m;
    for(int i = 1; i <= m; ++i)
    {
        int x, y;
        cin >> x >> y;
        if(x == 0)
        {
            int rez = c1(y);
            if(rez == -1) cout << -1 << '\n';
            else cout << sir[rez].ind << '\n';
        }
        else if(x == 1)
            cout << sir[c2(y)].ind << '\n';
        else
            cout << sir[c3(y)].ind << '\n';
    }
    return 0;
}

int c1(int k)
{
    int pas = 1 << 16, i = 0;
    while(pas)
    {
        if(i + pas <= n && sir[i + pas].nr <= k)
            i += pas;
        pas /= 2;
    }
    if(sir[i].nr == k)
    return i;
    return -1;
}

int c2(int k)
{
    int pas = 1 << 19, i = 0;
    while(pas)
    {
        if(i + pas <= n && sir[i + pas].nr <= k)
            i += pas;
        pas /= 2;
    }
    return i;
}
int c3(int k)
{
    int pas = 1 << 19, i = 0;
    while(pas)
    {
        if(i + pas <= n && sir[i + pas].nr < k)
            i += pas;
        pas /= 2;
    }
    return i + 1;
}