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

void burn() {
    ios::sync_with_stdio(0);
    cin.tie(0);
}
int C(const vector<int>& operations, const vector<int>& a, const vector<int>& b) {
    int current_location = 0; 
    int explosives = 0;       
    int total_cost = 0;       

    unordered_set<int> factories(a.begin(), a.end()); 
    unordered_set<int> mines(b.begin(), b.end());     

    for (int i = 0; i < operations.size(); i++) {
        int next_location = operations[i];
        
        int distance = abs(next_location - current_location);

        if (explosives > 0) {
            total_cost += distance;
        }
        
        current_location = next_location;

        if (factories.count(next_location)) {
            explosives++;  
        } else if (mines.count(next_location)) {
            explosives--;  
        }
    }

    return total_cost;
}


void solve() {
    int n, c;
    cin >> n >> c;
    vector<int> a(n), b(n);
    vector<int> all(2 * n);
    
    for (int i = 0; i < n; i++) {
        int x; cin >> x;
        a[i] = x;
        all[i] = x;
    }
    for (int i = 0; i < n; i++) {
        int x; cin >> x;
        b[i] = x;
        all[n + i] = x;
    }

    sort(all.begin(), all.end());

    vector<int> x, y, z;

    for (int i = 0; i < n - 1; i++) {
        x.push_back(all[i]);
    }
    for (int i = n - 1; i < 2 * n - 2; i++) {
        z.push_back(all[i]);
    }
    reverse(z.begin(), z.end()); 
    y.push_back(all[2 * n - 1]);
    y.push_back(all[2 * n - 2]);
    vector<int> finale;
    finale.reserve(2 * n);  
    finale.insert(finale.end(), x.begin(), x.end()); 
    finale.insert(finale.end(), y.begin(), y.end()); 
    finale.insert(finale.end(), z.begin(), z.end()); 

    cout << C(finale,a,b) << "\n";

    for (auto i : finale) {
        cout << i << " ";
    }
    cout << "\n";
}

int main() {
    burn();
    solve();
    return 0;
}