#include<bits/stdc++.h>
using namespace std;
 
#define int long long
const int MOD = (int)1e9 + 7;

int binpow(int a, int b) {
    a %= MOD;
    int res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a % MOD;
        a = a * a % MOD;
        b >>= 1;
    }
    return res;
}
int inverse(int x){
    return binpow(x, MOD - 2);
}

void solve()
{
    int N, Q;
    cin >> N >> Q;
    vector<int> A(N);
    for(int i = 0; i < N; i++)  cin >> A[i];
    sort(A.begin(), A.end());
    auto search = [&](int K){
        int l = 0, r = N - 1;
        while(l <= r){
            int mid = (l + r) / 2;
            int num = A[mid] - (mid + 1);
            if(num == K){
                if(mid > 0 && ((A[mid - 1] - mid) == K)){
                    r = mid - 1;
                    continue;
                }
                return A[mid] - 1;
            }
            if(num < K) l = mid + 1;
            else if(K < num)    r = mid - 1;
        }
        if(r < 0)   return K;
        int less = A[r] - (r + 1);
        K -= less;
        return A[r] + K;
    };
    while(Q--){
        int K;
        cin >> K;
        cout << search(K) << "\n";
    }
}
 
signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    solve();
    cerr << "Time elapsed : " << 1.0 * clock() / CLOCKS_PER_SEC << " sec \n ";
}
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

map <string, int> str;  // map のデータ構造を用意する。
string s[200010];

int main() {
	int n;

	cin >> n;
	rep(i, n) {
		cin >> s[i];
		if (s[i].at(0)=='!'){
			if (str[s[i]]==1){
				cout << s[i].substr(1) << endl;
				return 0;
			}
			str[s[i]]=10;
		}else{
			if (str['!'+s[i]]==10){
				cout << s[i] << endl;
				return 0;
			}
			str['!'+s[i]]=1;
		}
	}
	cout << "satisfiable" << endl;
	return 0;
}