csp202006-1

#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define ll long long
const int mod = 1000000007;
const int N = 2e5+6;


	int a[1050][2];
	char c[1050];
	ll n,m;
	
bool jud(int x,int y,int z)
{
	char f1='c',f2='c';
	rep(i,1,n)
		{
			int temp=x+y*a[i][0]+z*a[i][1];
			if(temp>0)
			{
				if(f1!='c'&&f1!=c[i])return false;
				f1=c[i];
			}
			if(temp<0)
			{
				if(f2!='c'&&f2!=c[i])return false;
				f2=c[i];
			}
		}
	return true;
}

int main()
{
	std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	cin>>n>>m;
	rep(i,1,n)cin>>a[i][0]>>a[i][1]>>c[i];
	rep(i,1,m)
	{
		int x,y,z;
		cin>>x>>y>>z;
		if(jud(x,y,z))cout<<"Yes"<<endl;
		else cout<<"No"<<endl;
	}
}