#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;
#define N 205
#define M 10100
#define inf 0x3f3f3f3f
struct Edge
{int u,v;int a,b;int c;void read(){scanf("%d%d%d%d",&u,&v,&a,&b);u++;v++;}
}e[M];
bool cmpa(const Edge &a,const Edge &b){return a.a<b.a;
}
bool cmpb(const Edge &a,const Edge &b){return a.b<b.b;
}
bool cmpc(const Edge &a,const Edge &b){return a.c<b.c;
}
struct Point{int x,y;void print(){printf("%d %d\n",x,y);}Point(int _x=0,int _y=0):x(_x),y(_y){}bool operator < (const Point &A) const{unsigned int p=x;p*=y;unsigned int q=A.x;q*=A.y;return p==q?x<A.x:p<q;}
}ans,now,mina,minb;
int f[N],n,m;
int find(int x){return f[x]==x?f[x]:f[x]=find(f[x]);
}
Point kruscal()
{int i,fa,fb;now=Point(0,0);for(int i=1;i<=n;i++)f[i]=i;for(int i=1;i<=m;i++){fa=find(e[i].u);fb=find(e[i].v);if(fa!=fb){f[fb]=fa;now.x+=e[i].a;now.y+=e[i].b;}}if(now<ans)ans=now;return now;
}
int xmul(const Point &A,const Point &B,const Point &C)
{return (C.y-A.y)*(B.x-A.x)-(C.x-A.x)*(B.y-A.y);}
void work(const Point &a,const Point &b)
{for(int i=1;i<=m;i++){e[i].c=e[i].b*(a.x-b.x)+e[i].a*(b.y-a.y);}sort(e+1,e+m+1,cmpc);Point c=kruscal();if(xmul(a,b,c)<=0)return;work(a,c);work(b,c);
}
int main()
{
//  freopen("test.in","r",stdin);int i,j,k;int a,b,c;ans=Point(inf,inf);scanf("%d%d",&n,&m);for(i=1;i<=m;i++)e[i].read();sort(e+1,e+m+1,cmpa),mina=kruscal();sort(e+1,e+m+1,cmpb),minb=kruscal();work(minb,mina),ans.print();return 0;
}

#include<iostream>#include<cstring>
#include<cstdio>
#define inf 0x7fffffff
struct poi{int x,y;}le,ri;
int lx[75],ly[75],sla[75];
int g[75][75],a[75][75],b[75][75],f[75];
int n;
bool vx[75],vy[75];
bool operator ==(poi a,poi b){return a.x==b.x&&a.y==b.y;}
using namespace std;
bool dfs(int x)
{vx[x]=true;for (int y=1; y<=n; y++){if (!vy[y]){int t=lx[x]+ly[y]-g[x][y];if (!t){vy[y]=true;if (!f[y]||dfs(f[y])){f[y]=x;return true;}}else sla[y]=min(sla[y],t);}}return false;
}
poi km()
{memset(lx,0,sizeof(lx)); memset(ly,0,sizeof(ly)); memset(f,0,sizeof(f));for (int i=1; i<=n; i++) for (int j=1; j<=n; j++)  lx[i]=max(lx[i],g[i][j]);for (int x=1; x<=n; x++){memset(sla,63,sizeof(sla));while (true){memset(vx,0,sizeof(vx)); memset(vy,0,sizeof(vy));if (dfs(x)) break;int d=inf;for (int i=1; i<=n; i++) if (!vy[i]) d=min(d,sla[i]);for (int i=1; i<=n; i++){if (vx[i]) lx[i]-=d;if (vy[i]) ly[i]+=d;}}}poi ans=(poi) {0,0};for (int i=1; i<=n; i++) ans.x+=a[f[i]][i], ans.y+=b[f[i]][i];return ans;
}
int slove(poi l,poi r)
{for(int i=1; i<=n; i++) for (int j=1; j<=n; j++) g[i][j]=a[i][j]*(r.y-l.y)+b[i][j]*(l.x-r.x);poi mid=km();if (l==mid||r==mid) return min(l.x*l.y,r.x*r.y);elsereturn min(slove(l,mid),slove(mid,r));
}
int main()
{int t;scanf("%d",&t);for (int z=1; z<=t; z++){scanf("%d",&n);for (int i=1; i<=n; i++) for (int j=1; j<=n; j++) scanf("%d",&a[i][j]);for (int i=1; i<=n; i++) for (int j=1; j<=n; j++) scanf("%d",&b[i][j]);for (int i=1; i<=n; i++) for (int j=1; j<=n; j++) g[i][j]=-a[i][j];le=km();for (int i=1; i<=n; i++) for (int j=1; j<=n; j++) g[i][j]=-b[i][j];ri=km();printf("%d\n",slove(le,ri));}
}