#include <bits/stdc++.h>
#include <cassert>

using namespace std;
using ll = long long;

#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define pb push_back
#define ff first
#define sc second
#define int ll

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
template<typename T>
void shuf(vector<T>& a) {
    for (int i = 1; i < sz(a); i++) swap(a[i], a[rnd() % (i + 1)]);
}

void solve() {
    int k, n; cin >> k >> n;
    vector<pair<int, int>> lol;
    int ans = 0;
    for (int i = 0; i < n; i++) {
        char r1, r2;
        int p1, p2;
        cin >> r1 >> p1 >> r2 >> p2;
        if (r1 == r2) {
            ans += abs(p1 - p2);
            continue;
        }
        ans++;
        lol.pb({p1, p2});
    }

    vector<int> ap;
    for (int i = 0; i < sz(lol); i++) {
        ap.pb(lol[i].first); ap.pb(lol[i].second);
    }
    int best = 1e18;
    for (int p1 : ap){
        for (int p2 : ap) {
            int cur = 0;
            for (auto u : lol) {
                cur += min(abs(u.first - p1) + abs(u.second - p1), abs(u.first - p2) + abs(u.second - p2));
            }
            best = min(best, cur);
        }
    }
    cout << best + ans << '\n';
}

signed main() {
    int tt = 1;
    #ifdef LOCAL
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        cin >> tt;
    #else
        ios::sync_with_stdio(false);
        cin.tie(0); cout.tie(0);
    #endif

    while (tt--) {
        solve();
    }

    return 0;
}