#include<bits/stdc++.h>
#define int long long
#define PII pair<int,int>
#define ULL unsigned long long
#define all(v) v.begin(), v.end()
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
constexpr int N =  1 * 1e6 + 10,M = 5 * 1e3 + 10,inf = 0x3f3f3f3f;

vector<int> vec;
int find1(int n)
{
    return lower_bound(all(vec),n) - vec.begin();
}
int find2(int n)
{
    return upper_bound(all(vec),n) - vec.begin();
}
void solve()
{
    int n,q;
    cin >> n >> q;
    vec.resize(n);
    for(int i=0;i<n;i++) cin >> vec[i];
    while(q--)
    {
        int x;
        cin >> x;
        int l = find1(x) , r = find2(x)-1;
        if(vec[l] == x && vec[r]==x) cout << l << ' ' << r << '\n';
        else cout << "No answer" << '\n';
    }
}
signed main()
{
    ios::sync_with_stdio(0);cin.tie(nullptr),cout.tie(nullptr);
    int _=1;
    // cin>>_;
    while(_--)
    {
        solve();
    }
    return 0;
}

/**
 *    author: Nijika_jia
 *    created: 2024.11.21 23:19:38
 */