#include <iostream>
#include<algorithm>
using namespace std;
#define ll long long
int main()
{
    int n, q;
    ll a[300005];
    cin >> n >> q;
    for (int i = 1; i <= n; i++) cin >> a[i];
    sort(a+1,a+1+n);
    ll p[300005] = { 0 };
    for (int j = 1; j <= n - 2; j++)
    {
        ll num = ((n - j) * (n - j - 1)) / 2;
        p[a[j]] += num;
    }
    for (int b = 2; b <= n - 2; b++)
    {
        if (a[b] != a[b - 1]) p[a[b]] += p[a[b - 1]];
    }
    while (q--)
    {
        ll k;
        cin >> k;
        int l = 0;
        int r = n +1;
        while (l +1 != r)
        {
          int mid = (l + r) / 2;
          if (k <= p[a[mid]]) r = mid;
          else l = mid;
        }
        cout << a[r] << '\n';
    }
    return 0;
}
copy