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

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int Q;
    cin >> Q;
    
    while (Q--) {
        int N, M;
        cin >> N >> M;
        
        vector<long long> S(M), G(M);
        for (int i = 0; i < M; i++) cin >> S[i];
        for (int i = 0; i < M; i++) cin >> G[i];
        
        // 目標配置がソート済みか確認
        vector<long long> G_sorted = G;
        sort(G_sorted.begin(), G_sorted.end());
        
        if (G != G_sorted) {
            cout << "-1\n";
            continue;
        }
        
        // 初期配置をソート
        vector<long long> S_sorted = S;
        sort(S_sorted.begin(), S_sorted.end());
        
        // 最小操作回数 = 対応する要素間の距離合計
        long long total_cost = 0;
        for (int i = 0; i < M; i++) {
            total_cost += abs(S_sorted[i] - G_sorted[i]);
        }
        
        cout << total_cost << "\n";
    }
    
    return 0;
}