#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <climits>
using namespace std;

struct node
{
	char s;
	int c;
};
int n,q,max1;
const int maxn=100000+1;
int a[maxn];
node b[maxn];
int d[maxn];
int zd[2000][2000];

void j1(int x);

int main()
{
	freopen("jxthree.in","r",stdin);
	freopen("jxthree.out","w",stdout);
	//freopen("test.in","r",stdin);
	//freopen("test.out","w",stdout); 
	
	cin>>n>>q;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
	}
	for(int i=1;i<=q;i++)
	{
		cin>>b[i].s;
		scanf("%d",&b[i].c);
	}
	zd[1][1]=a[1];
	for(int i=1;i<n;i++)
	{
		for(int j=i;j<=n;j++)
		{
			for(int k=i+1;k<j;k++)
				zd[i][j]=max(zd[i][k],zd[k][j]);
				
			j1(zd[i][j]);
		}
	}
	for(int i=1;i<=q;i++)
	{
		cout<<d[i]<<endl;
	}
	return 0;
}
void j1(int x)
{
	for(int j=1;j<=q;j++)
	{
		if(b[j].s=='>')
		{
			if(x>b[j].c)
			{
				d[j]++;
			}
		}
		if(b[j].s=='<')
		{
			if(x<b[j].c)
			{
				d[j]++;
			}
		}
		if(b[j].s=='=')
		{
			if(x==b[j].c)
			{
				d[j]++;
			}
		}
	}
}