#include<iostream>

using namespace std;

const int N = 1e-6;

int arr[N];

int findFirst(int arr[], int arrlen, int check)
{
	int left = 0 , right = arrlen - 1;
	while(left <= right)
	{
		int mid = (left + right ) / 2;
		if (arr[mid] >= check)
		{
			right = mid - 1 ; // if bigger just continue
			// 如果已经找到匹配的值了，我们还是要把右指针往左靠，知道找到更小的，此时左指针就是第一次出现的位置，以下同理
		}
		else if (arr[mid] < check)
		{
			left = mid + 1; // if smaller
			// will be first one equal to target
		}
	}
	return left;
}

int findLast(int arr[], int arrlen , int check)
{
	int left = 0 , right = arrlen - 1;
	while(left <= right)
	{
		int mid = (left + right ) / 2;
		if (arr[mid] <= check)
		{
			left = mid + 1; // if smaller
		}
		else if ( arr[mid] > check)
		{
			right = mid - 1 ; // if bigger just continue
			// will be last one equal to target
		}
	}
	return right;
}

int main()
{
	int arrlen , querry;
	cin >> arrlen >> querry;
	
	for ( int i = 0 ; i < arrlen ; i ++ )
	{
		cin >> arr[i];
	}
	
	while(querry--)
	{
		int check;
		cin >> check;
		int first = findFirst(arr,arrlen,check);
		int last = findLast(arr, arrlen,check);
		if (first >= arrlen || arr[first] != check) 
		{
			cout << "-1 -1\n";
			continue;
		}
		cout << first << ' ' << last << '\n';
	}
}

#include<iostream>
#include<algorithm>

using namespace std;
const int N = 1e5 + 1;

int arr[N];

int findValue(int arr[] , int arrlen , int target,int start)
{
	int left = start , right = arrlen - 1;
	while(left <= right)
	{
		int mid = (left + right) / 2;
		
		if (arr[mid] > target)
		{
			right = mid - 1;
		}else if (arr[mid] < target)
		{
			left = mid + 1;
		}else {
			return mid;
		}
	}
	
	return -1;
}

int main()
{
	// arr[a] + arr[b] = N --> arr[a] = N - arr[b]
	int arrlen , querry ,flag = 0;
	cin >> arrlen >> querry ;
	
	for (int i = 0 ; i < arrlen ; i++)
	{
		cin >> arr[i];
	}
	sort(arr,arr + arrlen);
	while (querry--)
	{
		int target ;
		cin >> target ;
		flag = 0;
		for (int i = 0 ; i < arrlen ; i++)
		{
			int temp = target - arr[i];
			
			int returnValue = findValue(arr, arrlen, temp,i+1);
			
			if (returnValue != -1)
			{
				cout << 1 << '\n';
				flag = 1;
				break;
			}
		}
		if (flag == 0)
		{
			cout << 0 << '\n';
		}
	}
	return 0;
}