#include<iostream>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
using namespace std;




int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n, m;
    cin >> n >> m;
    vector<int> v(n);
    for(int i = 0; i < n; ++i)
    {
        cin >> v[i];
    }
    sort(v.begin(), v.end());
    //for(auto elem: v) cout << elem << ' ';
    cout << endl;
    for(int a = 0; a < m; ++a)
    {
        int p;
        cin >> p;
        int i = 0;
        int j;
        bool flag = false;
        while(i < v.size() && p - v[i] >= v[i])
        {
            int k = lower_bound(v.begin() + i + 1, v.end(), p - v[i]) - v.begin();
            if(v[i] + v[k] == p && k != i)
            {
                flag = true;
                j = v[k];
                i = v[i];
                break;
            }
            i++;
        }
        if(flag) cout << min(i, j) << ' ' << max(j, i) << endl;
        else cout << "Not found" << endl;

    }





}