#include<stdio.h>
int h[200005], l;
int comp_h(int a, int b)
{
	if (h[a] > h[b])
		return 1;
	else
		return -1;
}
void swap_h(int a, int b)
{
	int f = h[a];
	h[a] = h[b];
	h[b] = f;
	return;
}
void push(int ne)
{
	h[l] = ne;
	int p = l++;
	for (; p > 0; p = (p - 1) / 2)
		if (comp_h((p - 1) / 2, p) > 0)
			swap_h((p - 1) / 2, p);
	return;
}
int pop()
{
	swap_h(0, --l);
	int p = 0;
	for (;;)
	{
		if (2 * p + 2 < l)
		{
			if (comp_h(2 * p + 1, 2 * p + 2) > 0)
			{
				if (comp_h(p, 2 * p + 2) > 0)
					swap_h(p, 2 * p + 2);
				p = 2 * p + 2;
			}
			else
			{
				if (comp_h(p, 2 * p + 1) > 0)
					swap_h(p, 2 * p + 1);
				p = 2 * p + 1;
			}
		}
		else if (2 * p + 1 < l)
		{
			if (comp_h(p, 2 * p + 1) > 0)
				swap_h(p, 2 * p + 1);
			p = 2 * p + 1;
		}
		else
			break;
	}
	return h[l];
}
int a[200005];
int n;
int count(int x)
{
	int min, mid, max, left, right;
	min = -1;
	max = n;
	while (max - min > 1)
	{
		mid = (max + min) / 2;
		if (a[mid] < x)
			min = mid;
		else
			max = mid;
	}
	left = max;
	min = -1;
	max = n;
	while (max - min > 1)
	{
		mid = (max + min) / 2;
		if (a[mid] > x)
			max = mid;
		else
			min = mid;
	}
	right = max;
	return right - left;
}
int main()
{
	scanf("%d", &n);
	int i;
	for (i = 0; i < n; i++)
		scanf("%d", &a[i]);
	l = 0;
	for (i = 0; i < n; i++)
		push(a[i]);
	for (i = 0; i < n; i++)
		a[i] = pop();
	int q, x, k;
	scanf("%d", &q);
	for (; q > 0; q--)
	{
		scanf("%d %d", &x, &k);
		if (count(x) < k)
			printf("No\n");
		else
			printf("Yes\n");
	}
	return 0;
}