#include<stdio.h>
#include<algorithm>
using namespace std;
typedef struct{
	int zz,qq;
}elev;
elev a[100],b[100];
int i,j,n,m,nr,a1,b1,c1;
double x,y;
inline bool cmp(elev x,elev y){
	return(x.zz==y.zz?0:x.zz<y.zz);
}
int main(){
	freopen("regiuni.in","r",stdin);
	freopen("regiuni.out","w",stdout);
	scanf("%d %d\n",&n,&m);
	for (i=1; i<=n; i++){
		scanf("%d %d %d",&a1,&b1,&c1);
		x=0;
		y=0;
		if (b1!=0)
		y=double((-c1)/b1);
		else y=0;
		if (a1!=0)
		x=double((-c1)/a1);
		else x=0;
		b[i].zz=max(x,y);
	}
	sort(b+1,b+n+1,cmp);
	for (i=1; i<=m; i++){
		scanf("%d %d\n",&a1,&b1);
		for (j=1; j<=n; j++)
			if (a1+b1<b[j].zz){
				a[i].zz=j;
				b[j].qq++;
			}
	}
	nr=0;
	for (i=1; i<=m; i++){
		if (a[i].zz!=0) nr++;
	}
	printf("%d",nr);
	return(0);
}