#pragma optimize("Bismillahirrahmanirrahim")
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//Allahuekber
//ahmet23 orz...
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulhamidHan
#define author tolbi
#include <bits/stdc++.h>
using namespace std;
template<typename X, typename Y> istream& operator>>(istream& in, pair<X,Y> &pr) {return in>>pr.first>>pr.second;}
template<typename X, typename Y> ostream& operator<<(ostream& os, pair<X,Y> pr) {return os<<pr.first<<" "<<pr.second;}
template<typename X> istream& operator>>(istream& in, vector<X> &arr) {for(auto &it : arr) in>>it; return in;}
template<typename X> ostream& operator<<(ostream& os, vector<X> arr) {for(auto &it : arr) os<<it<<" "; return os;}
template<typename X, size_t Y> istream& operator>>(istream& in, array<X,Y> &arr) {for(auto &it : arr) in>>it; return in;}
template<typename X, size_t Y> ostream& operator<<(ostream& os, array<X,Y> arr) {for(auto &it : arr) os<<it<<" "; return os;}
#define int long long
#define endl '\n'
#define vint(x) vector<int> x
#define deci(x) int x;cin>>x;
#define decstr(x) string x;cin>>x;
#define cinarr(x) for (auto &it : x) cin>>it;
#define coutarr(x) for (auto &it : x) cout<<it<<" ";cout<<endl;
#define sortarr(x) sort(x.begin(),x.end())
#define sortrarr(x) sort(x.rbegin(),x.rend())
#define det(x) cout<<"NO\0YES"+x*3<<endl;
#define INF LONG_LONG_MAX
#define rev(x) reverse(x.begin(),x.end());
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define tol(bi) (1LL<<((int)(bi)))
const int MOD = 1e9+7;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
int32_t main(){
ios;
int t=1;
int tno = 0;
if (!t) cin>>t;
while (t-(tno++)){
deci(k);deci(n);
vector<pair<int,int>> arr;
int ans = 0;
vector<int> poses;
for (int i = 0; i < n; i++){
char a,c;
int b,d;
cin>>a>>b>>c>>d;
if (a==c) ans+=abs(b-d);
else {
ans+=abs(b-d);
ans++;
arr.push_back({min(b,d),max(b,d)});
poses.push_back(b);
poses.push_back(d);
poses.push_back(b+1);
poses.push_back(b-1);
poses.push_back(d+1);
poses.push_back(d-1);
}
}
int crr = INF;
for (int i = 0; i < poses.size(); i++){
function<int(int)> query = [&](int x){
int p1 = poses[i];
int p2 = x;
if (p1>p2) swap(p1,p2);
int rval = 0;
for (int j = 0; j < arr.size(); j++){
if (arr[j].second<=p1){
rval+=p1-arr[j].second;
}
else if (arr[j].first<=p1){
continue;
}
else if (arr[j].first>=p2){
rval+=arr[j].first-p2;
}
else if (arr[j].second>=p2){
continue;
}
else {
rval+=min(p2-arr[j].second,arr[j].first-p1);
}
}
return rval;
};
int l = poses[i]+1, r = 1000000000;
while (l<r){
int mid = l+(r-l)/2;
int res = query(mid);
int res2 = query(mid+1);
if (res>res2){
l=mid+1;
}
else r = mid;
}
crr=min(crr,query(l));
l = 0, r = poses[i]-1;
while (l<r){
int mid = l+(r-l)/2;
int res = query(mid);
int res2 = query(mid+1);
if (res>=res2){
l=mid+1;
}
else r=mid;
}
crr=min(crr,query(l));
}
cout<<ans+crr*2<<endl;
}
}
