uva1398

#include<iostream>#include<algorithm>#include<cstdio>using namespace std;struct tt{   double s;   int type;   bool operator<(tt &ss){   return (s<ss.s||(ss.s==s&&type==1));   }}ll[1000000];int w,h,n;double max(double a,double b){  if(a>b)  return a;return b;}double min(double a,double b){   if(a>b)   return b;   return a;}void update(int x,int w,int a,double &be,double &en){  if(a==0)  {    if(x<=0||x>=w)en=be-1;  }  else if(a>0)  {   be=max(be,-1.0*x/a);   en=min(en,(w-x)*1.0/a);  }  else  {     be=max(be,(w-x)*1.0/a); en=min(en,-1.0*x/a);  }}int main(){int t;cin>>t;while(t--){int pos=0;  scanf("%d%d%d",&w,&h,&n);  int x,y,a,b,i;  for(i=0;i<n;i++){  scanf("%d%d%d%d",&x,&y,&a,&b);    double begin=0,end=10000000;update(x,w,a,begin,end);update(y,h,b,begin,end);if(end>begin){  ll[pos].s=begin;  ll[pos++].type=0;  ll[pos].s=end;  ll[pos++].type=1;}  }  sort(ll,ll+pos);  int ans=0,cnt=0;   for(i=0;i<pos;i++){    if(ll[i].type==0)ans=ans>++cnt?ans:cnt;elsecnt--;  }   printf("%d\n",ans);}return 0;}