#include <bits/stdc++.h>
using namespace std;

using ll=long long;
#define int ll

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using pi=pair<int,int>;
using vi=vc<int>;

template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.a<<","<<p.b<<"}";
}

template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}

#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))
#ifdef LOCAL
void dmpr(ostream&os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ";
	dmpr(os,args...);
}
#define dmp2(...) dmpr(cerr,__LINE__,##__VA_ARGS__)
#else
#define dmp2(...) void(0)
#endif

using uint=unsigned;
using ull=unsigned long long;

template<class t,size_t n>
ostream& operator<<(ostream&os,const array<t,n>&a){
	return os<<vc<t>(all(a));
}

template<int i,class T>
void print_tuple(ostream&,const T&){
}

template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
	if(i)os<<",";
	os<<get<i>(t);
	print_tuple<i+1,T,Args...>(os,t);
}

template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
	os<<"{";
	print_tuple<0,tuple<Args...>,Args...>(os,t);
	return os<<"}";
}

template<class t>
void print(t x,int suc=1){
	cout<<x;
	if(suc==1)
		cout<<"\n";
	if(suc==2)
		cout<<" ";
}

ll read(){
	ll i;
	cin>>i;
	return i;
}

vi readvi(int n,int off=0){
	vi v(n);
	rep(i,n)v[i]=read()+off;
	return v;
}

pi readpi(int off=0){
	int a,b;cin>>a>>b;
	return pi(a+off,b+off);
}

template<class T>
void print(const vector<T>&v,int suc=1){
	rep(i,v.size())
		print(v[i],i==int(v.size())-1?suc:2);
}

string readString(){
	string s;
	cin>>s;
	return s;
}

template<class T>
T sq(const T& t){
	return t*t;
}

//#define CAPITAL
void yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<"\n";
	#else
	cout<<"Yes"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void no(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<"\n";
	#else
	cout<<"No"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void possible(bool ex=true){
	#ifdef CAPITAL
	cout<<"POSSIBLE"<<"\n";
	#else
	cout<<"Possible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void impossible(bool ex=true){
	#ifdef CAPITAL
	cout<<"IMPOSSIBLE"<<"\n";
	#else
	cout<<"Impossible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}

constexpr ll ten(int n){
	return n==0?1:ten(n-1)*10;
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

int topbit(signed t){
	return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
	return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
	return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
	return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
	return __builtin_popcount(t);
}
int popcount(ll t){
	return __builtin_popcountll(t);
}
bool ispow2(int i){
	return i&&(i&-i)==i;
}
ll mask(int i){
	return (ll(1)<<i)-1;
}

bool inc(int a,int b,int c){
	return a<=b&&b<=c;
}

template<class t> void mkuni(vc<t>&v){
	sort(all(v));
	v.erase(unique(all(v)),v.ed);
}

ll rand_int(ll l, ll r) { //[l, r]
	#ifdef LOCAL
	static mt19937_64 gen;
	#else
	static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
	#endif
	return uniform_int_distribution<ll>(l, r)(gen);
}

template<class t>
void myshuffle(vc<t>&a){
	rep(i,si(a))swap(a[i],a[rand_int(0,i)]);
}

template<class t>
int lwb(const vc<t>&v,const t&a){
	return lower_bound(all(v),a)-v.bg;
}

vvc<int> readGraph(int n,int m){
	vvc<int> g(n);
	rep(i,m){
		int a,b;
		cin>>a>>b;
		//sc.read(a,b);
		a--;b--;
		g[a].pb(b);
		g[b].pb(a);
	}
	return g;
}

vvc<int> readTree(int n){
	return readGraph(n,n-1);
}

struct W{
	int val;
	int a,b,c,d;
};

const int nmax=810;
int bonus[nmax*2][nmax*2];

int sub(int S,vc<W> waf,vc<W> unko){
	vi xs{0,4*S},ys{0,4*S};
	for(auto&w:waf){
		w.c--;
		w.d++;
	}
	for(auto&w:unko){
		bool f=false;
		for(const auto&z:waf){
			if(w.a<=z.c&&z.d<=w.b){
				f=true;
				break;
			}
		}
		if(!f){
			swap(w.a,w.c);
			swap(w.b,w.d);
		}
		w.c=0;
		w.d=4*S;
	}
	waf.insert(waf.ed,all(unko));
	int n=si(waf);
	rep(i,n){
		xs.pb(waf[i].a);
		xs.pb(waf[i].c);
		ys.pb(waf[i].b);
		ys.pb(waf[i].d);
	}
	mkuni(xs);
	mkuni(ys);
	int len=si(ys);
	//vvc<int> bonus(si(xs)-1,vi(len));
	int wid=si(xs)-1;
	rep(i,wid)rep(j,len)bonus[i][j]=0;
	auto add=[&](int a,int b,int c){
		a=lwb(xs,a);
		b=lwb(ys,b);
		assert(a<wid);
		assert(0<b);
		bonus[a][b-1]+=c;
	};
	for(auto w:waf){
		add(w.a,w.b,-w.val);
		add(w.c,w.d,w.val);
	}
	rep(i,wid)per(j,len-1)bonus[i][j]+=bonus[i][j+1];
	vi dp(len);
	rep(i,wid){
		rep(j,len)dp[j]+=bonus[i][j];
		rng(j,1,len)chmax(dp[j],dp[j-1]);
	}
	//print(dp.back());
	return dp.back();
}

void slv(){
	int S,n;cin>>S>>n;
	vc<W> waf;
	auto readpos=[&](){
		int x,y;cin>>x>>y;
		if(y==0)return x;
		else if(x==S)return S+y;
		else if(y==S)return S+S+S-x;
		else if(x==0)return S+S+S+S-y;
		else assert(0);
	};
	rep(i,n){
		int val;cin>>val;
		int a=readpos();
		int b=readpos();
		if(a>b)swap(a,b);
		int c=readpos();
		int d=readpos();
		if(c>d)swap(c,d);
		if(a<c){
			swap(a,c);
			swap(b,d);
		}
		//dmp2(i,a,b,c,d);
		waf.pb({val,a,b,c,d});
	}
	int ans=0;
	struct Q{
		int x,t,i;
		bool operator<(const Q&rhs)const{
			if(x!=rhs.x)return x<rhs.x;
			else if(t!=rhs.t)return t<rhs.t;
			else return i<rhs.i;
		}
	};
	vc<Q> qs;
	vc<W> unko;
	rep(i,n){
		if(waf[i].b<waf[i].d){
			qs.pb({waf[i].c,0,i});
			qs.pb({waf[i].d,1,i});
		}else{
			unko.pb(waf[i]);
			ans+=waf[i].val;
		}
	}
	sort(all(qs));
	vc<bool> cur(n);
	bool need=false;
	for(auto w:qs){
		if(w.t==0){
			cur[w.i]=true;
			need=true;
		}else{
			if(need){
				vc<W> tmp;
				rep(i,n)if(cur[i])tmp.pb(waf[i]);
				chmax(ans,sub(S,tmp,unko));
			}
			cur[w.i]=false;
			need=false;
		}
	}
	print(ans);
}

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	
	int t;cin>>t;
	rep(i,t){
		cerr<<"Process Test "<<i+1<<endl;
		cout<<"Case #"<<i+1<<": ";
		slv();
	}
}