题解：

#include<bits/stdc++.h>

using namespace std;
int n, m;

struct Node {
	int x, y;
	char ch;
}node[1010];

bool judge(int x0, int x1, int x2)
{
	char ch1 = 'c', ch2 = 'd';
	for (int i = 0; i < n; i++)
	{
		int tmp = x0 + x1 * node[i].x + x2 * node[i].y;
		if (tmp == 0)
		{
			return false;
		}
		if (tmp > 0)
		{
			ch1 = node[i].ch;
		}
		else if (tmp < 0)
		{
			ch2 = node[i].ch;
		}
		if (ch1 == ch2)
		{
			return false;
		}
	}
	return true;
}

int main()
{
	int x0, x1, x2;
	cin >> n >> m;
	for (int i = 0; i < n; i++)
	{
		cin >> node[i].x >> node[i].y >> node[i].ch;
	}
	for (int i = 0; i < m; i++)
	{
		cin >> x0 >> x1 >> x2;
		if (judge(x0, x1, x2))
		{
			cout << "Yes" << endl;
		}
		else
		{
			cout << "No" << endl;
		}
	}
	return 0;
}