#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
 
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
 
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template<class T> using pq = priority_queue<T>;
template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
 
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a,x) for (auto& a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
 
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins insert

template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int MOD = 1000000007;
const char nl = '\n';
const int MX = 100001; 

void solve() {
    int N, Q; cin >> N >> Q;
    vl A(N); F0R(i, N) cin >> A[i];
    while(Q--) {
        ll K; cin >> K;
        ll lo = 0, hi = 3e18;
        while (lo < hi) {
            ll mid = (lo+hi)/2;
            ll num = ub(all(A), mid) - A.begin();
            if (mid-num >= K) {
                hi = mid;
            } else {
                lo = mid+1;
            }
        }
        cout << lo << nl;
    }

}
 
int main() {
    cin.tie(0)->sync_with_stdio(0); 
    cin.exceptions(cin.failbit);

    int T = 1;
//    cin >> T;
    while(T--) {
        solve();
    }

	return 0;
}



#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;

int main() {
    int N, K; cin >> N >> K;
    vector<vector<int>> A(N, vector<int>(N));
    for (auto &a : A) for (auto &v : a) cin >> v;

    int l = -1, h = 1e9, m;
    while (h - l > 1) {
        m = l + (h - l) / 2;
        // cout << "# m : " << m << endl;

        vector<vector<int>> acc(N + 1, vector<int>(N + 1));
        REP(i, 0, N) {
            REP(j, 0, N) {
                acc[i + 1][j + 1] = acc[i + 1][j] + acc[i][j + 1] - acc[i][j] + (A[i][j] <= m);
            }
        }

        bool ok = false;
        REP(i, 0, N) {
            if (i + K > N) continue;
            REP(j, 0, N) {
                if (j + K > N) continue;
                if (acc[i + K][j + K] - acc[i + K][j] - acc[i][j + K] + acc[i][j] >= (K * K + 1) / 2) ok = true;
            }
        }
        
        if (ok) h = m;
        else l = m;
    }

    cout << h << endl; 
    return 0;
}
