//https://oj.uz/problem/view/JOI14_fortune_telling2
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define FOD(i, a, b) for (int i = (a); i >= (b); --i)
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int mod = 7 + 1e9;
const int maxn = 5 + 5e5;
int n, m, q, a[maxn], b[maxn], k[maxn];
int ac[maxn], bc[maxn], kc[maxn], bit[maxn], t[maxn << 2];
vector<int> c;
pair<int, int> d[maxn];
void up(int id) {
for (; id; id -= id & -id) ++bit[id];
}
int calc(int id) {
int res = 0;
for (; id < maxn; id += id & -id) res += bit[id];
return res;
}
void update(int id, int l, int r, int pos, int val) {
if (pos < l || pos > r) return;
if (l == r) return void(t[id] = val);
int mid = l + r >> 1;
update(id << 1, l, mid, pos, val);
update(id << 1 | 1, mid + 1, r, pos, val);
t[id] = max(t[id << 1], t[id << 1 | 1]);
}
int get(int id, int l, int r, int u, int v) {
if (v < l || r < u) return 0;
if (l >= u && r <= v) return t[id];
int mid = l + r >> 1;
return max(get(id << 1, l, mid, u, v), get(id << 1 | 1, mid + 1, r, u, v));
}
bool cmp(const pii &p1, const pii &p2) {
if (p1.fi != p2.fi) return p1.fi < p2.fi;
return max(a[p1.se], b[p1.se]) > max(a[p2.se], b[p2.se]);
}
signed main() {
#define name "task"
if (fopen(name".inp", "r")) {
freopen(name".inp", "r", stdin);
freopen(name".out", "w", stdout);
}
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n >> q;
for (int i = 1; i <= n; ++i) {
cin >> a[i] >> b[i];
c.push_back(a[i]);
c.push_back(b[i]);
}
for (int i = 1; i <= q; ++i) {
cin >> k[i];
c.push_back(k[i]);
}
sort(c.begin(), c.end());
c.resize(unique(c.begin(), c.end()) - c.begin());
m = c.size();
// for (int i = 1; i <= n; ++i) {
// ac[i] = upper_bound(c.begin(), c.end(), a[i]) - c.begin();
// bc[i] = upper_bound(c.begin(), c.end(), b[i]) - c.begin();
// }
for (int i = 1; i <= q; ++i) {
// kc[i] = upper_bound(c.begin(), c.end(), k[i]) - c.begin();
update(1, 1, m, upper_bound(c.begin(), c.end(), k[i]) - c.begin(), i);
}
vector<tuple<int, int, int>> qr;
for (int i = 1; i <= n; ++i) {
int u = upper_bound(c.begin(), c.end(), a[i]) - c.begin();
int v = upper_bound(c.begin(), c.end(), b[i]) - c.begin();
if (u > v) swap(u, v);
qr.emplace_back(get(1, 1, m, u, v - 1), max(a[i], b[i]), i);
int j = get(1, 1, maxn - 1, u, v - 1);
//if (j && a[i] < b[i]) swap(a[i], b[i]), swap(ac[i], bc[i]);
d[i] = {j, i};
}
sort(qr.begin(), qr.end(), greater<tuple<int, int, int>>());
sort(d + 1, d + n + 1, cmp);
int j = n;
for (int i = q; i; --i) {
up(upper_bound(c.begin(), c.end(), k[i]) - c.begin());
while(qr.size() && get<0>(qr[0]) == i) {
auto [_, val, i] = qr.back(); qr.pop_back();
int cnt = calc(upper_bound(c.begin(), c.end(), val) - c.begin());
if (cnt & 1) {
if (a[i] > b[i]) swap(a[i], b[i]);
}
else {
if (a[i] < b[i]) swap(a[i], b[i]);
}
}
}
while (qr.size()) {
auto [_, val, i] = qr.back(); qr.pop_back();
int cnt = calc(upper_bound(c.begin(), c.end(), val) - c.begin());
if (cnt & 1) swap(a[i], b[i]);
}
ll res = 0;
for (int i = 1; i <= n; ++i) res += a[i];
cout << res;
return 0;
}
