#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,m;
int t[50010];
struct node{
int x,y,c;
}a[50010];
signed main() {
cin >> n >> m;
for(int i=1;i<=n;i++){
cin >> a[i].x >> a[i].y >> a[i].c;
}
while(m--){
int aa,bb,cc,ans=0;
memset(t,0,sizeof(t));
cin >> aa >> bb >> cc;
int tmp=1;
for(int i=1;i<=n;i++){
if (aa*a[i].x+bb*a[i].y+cc<0){
t[tmp]=i;
tmp++;
ans++;
}
}
for(int i=1;i<=tmp-2;i++){
for(int j=i+1;j<=tmp-1;j++){
if (a[t[i]].c==a[t[j]].c){
ans+=2;
}
}
}
cout << ans<<endl;
}
return 0;
}
剩下全T,大佬救救我!!!(回复必关!)