#include <iostream>
using std::cerr, std::cin, std::cout, std::endl, std::fixed, std::flush;
#include <vector>
using std::vector;
#include <algorithm>
using std::clamp, std::ranges::count, std::ranges::count_if, std::ranges::fill, std::ranges::find, std::ranges::find_if, std::ranges::is_permutation;
using std::ranges::lower_bound, std::ranges::max, std::ranges::max_element, std::ranges::min, std::ranges::min_element, std::ranges::next_permutation;
using std::ranges::prev_permutation, std::ranges::reverse, std::ranges::rotate, std::ranges::sort, std::ranges::unique, std::ranges::upper_bound;
static_assert(sizeof(long) == 8);
int main()
{
  int N;
  cin >> N;
  vector<int> A(N);
  for (int i = 0; i < N; i++)
  {
    cin >> A[i];
  }
  sort(A);
  int Q;
  cin >> Q;
  for (int i = 0; i < Q; i++)
  {
    int x, k;
    cin >> x >> k;
    cerr << upper_bound(A, x) - lower_bound(A, x) << '\n';
    if (upper_bound(A, x) - lower_bound(A, x) >= k)
      cout << "Yes\n";
    else
      cout << "No\n";
  }
  
  return 0;
}
/*
  File : ~/kyopro/yukicoder/554/3197.cpp
  Date : 2025/07/11
  Time : 21:27:05
*/