//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 + 2e5;
int n, m, q, a[maxn], b[maxn], k[maxn];
int ac[maxn], bc[maxn], kc[maxn];
vector<int> c;
pair<int, int> d[maxn];
struct SegmentTree {
vector<int> t;
SegmentTree(int n) {
t.resize(4 * n + 1);
}
void update(int id, int l, int r, int pos, int val) {
if (l == r) {
t[id] = val;
return;
}
int mid = (l + r) >> 1;
if (pos <= mid) update(id << 1, l, mid, pos, val);
else 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 (l > v || r < u || u > v) 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));
}
};
struct BinaryIndexedTree {
vector<int> bit;
int size;
BinaryIndexedTree(int n) : size(n){
bit.resize(n + 1);
}
void up(int id) {
for (; id; id -= id & -id) ++bit[id];
}
int calc(int id) {
int res = 0;
for (; id <= size; id += id & -id) res += bit[id];
return res;
}
};
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();
SegmentTree it(m);
for (int i = 1; i <= n; ++i) {
ac[i] = lower_bound(c.begin(), c.end(), a[i]) - c.begin() + 1;
bc[i] = lower_bound(c.begin(), c.end(), b[i]) - c.begin() + 1;
}
for (int i = 1; i <= q; ++i) {
kc[i] = lower_bound(c.begin(), c.end(), k[i]) - c.begin() + 1;
it.update(1, 1, m, kc[i], i);
}
for (int i = 1; i <= n; ++i) {
int u = ac[i], v = bc[i];
if (u > v) swap(u, v);
int j = it.get(1, 1, m, u, v - 1);
if (j && a[i] < b[i]) swap(a[i], b[i]), swap(ac[i], bc[i]);
d[i] = {j, i};
}
sort(d + 1, d + n + 1, cmp);
BinaryIndexedTree bit(m);
for(int i = q, j = n; i >= 0; --i) {
if (!i) {
for (; j; --j) {
int cnt = bit.calc(max(ac[d[j].se], bc[d[j].se]));
if (cnt & 1) swap(a[d[j].se], b[d[j].se]);
}
continue;
}
bit.up(kc[i]);
while(j && d[j].fi == i) {
int cnt = bit.calc(ac[d[j].se]);
if (cnt & 1) swap(a[d[j].se], b[d[j].se]);
--j;
}
}
ll res = 0;
for (int i = 1; i <= n; ++i) res += a[i];
cout << res;
return 0;
}
