#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    int N, M;
    cin >> M >> N;
    vector<int> sorok(M-1);
    vector<int> oszlopok(N-1);
    for (int i = 0; i < M-1; i++) {
        cin >> sorok[i];
    }
    for (int i = 0; i < N-1; i++) {
        cin >> oszlopok[i];
    }
    sort(oszlopok.begin(), oszlopok.end());
    sort(sorok.begin(), sorok.end());
    //for (auto& r : sorok) cout << r << " ";
    //cout << endl;
    int vizszintesvagasok = 0;
    int fuggolegesvagasok = 0;

    int total_cost = 0;

    while (true) {
        int greatest_in_oszlop = 0;
        if (!oszlopok.empty()) {
            greatest_in_oszlop = oszlopok.back();
        }
        int greatest_in_sor = 0;
        if (!sorok.empty()) {
            greatest_in_sor = sorok.back();
        }
        cout << greatest_in_oszlop << " " << greatest_in_sor << endl;
        if (greatest_in_sor == 0 && greatest_in_oszlop == 0) {
            break;
        }
        if (greatest_in_oszlop > greatest_in_sor) {
            fuggolegesvagasok++;
            total_cost += (vizszintesvagasok + 1) * greatest_in_oszlop;
            oszlopok.pop_back();
        }
        else {
            vizszintesvagasok++;
            total_cost += (fuggolegesvagasok + 1) * greatest_in_sor;
            sorok.pop_back();
        }
    }
    cout << total_cost;
}