#include <iostream>
#include <vector>
#include <algorithm>
int main()
{
    int n,m;
    std::cin >> n >> m;
    std::vector<int> v;
    for (int i = 0; i < n; ++i)
    {
        int temp;
        std::cin >> temp;
        v.push_back(temp);
    }
    std::sort(v.begin(),v.end());
    std::vector<int> requests;
    for (int i = 0; i < m; ++i)
    {
        int temp;
        std::cin >> temp;
        requests.push_back(temp);
    }
    for (auto request : requests)
    {
        std::vector<int>::iterator low, up;
        low = std::lower_bound (v.begin(), v.end(), request);
        up  = std::upper_bound (v.begin(), v.end(), request);
        if (low - v.begin() + 1 <= up-v.begin()) {
            std::cout << low - v.begin() +1 << " " << up - v.begin() << '\n';
        }
        else {
            std::cout << "0\n";
        }
    }

    return 0;
}