#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2 * 100100, MAXK = 2 * 100100, MAXA = 1e9 + 1e4;
int n, k, a[MAXN], b[MAXN], t[MAXK];
long long ans = 0;
struct no
{
int cnt;
no *l, *r;
no(int cnt = 0) : cnt(cnt), l(nullptr), r(nullptr)
{}
};
inline int getcnt(no *n) { return (n ? n->cnt : 0); }
no* upd(no* n, int pos, int val = 1, int beg = 1, int end = MAXA)
{
if(beg == end)
return new no(getcnt(n) + val);
no* ans = (n ? new no(*n) : new no());
int mid = (beg + end) >> 1;
if(pos <= mid)
ans->l = upd(ans->l, pos, val, beg, mid);
else
ans->r = upd(ans->r, pos, val, mid + 1, end);
ans->cnt = getcnt(ans->l) + getcnt(ans->r);
return ans;
}
int get(no* n, int pos, int beg = 1, int end = MAXA)
{
if(!n)
return 0;
int mid = (beg + end) >> 1;
if(pos <= mid)
return get(n->l, pos, beg, mid) + getcnt(n->r);
return get(n->r, pos, mid + 1, end);
}
no* pseg[MAXK];
int main()
{
pseg[0] = nullptr;
scanf("%d %d", &n, &k);
for(int i = 1; i <= n; ++i)
scanf("%d %d", &a[i], &b[i]);
for(int i = 1; i <= k; ++i)
scanf("%d", &t[i]), pseg[i] = upd(pseg[i - 1], t[i]);
for(int i = 1, swaps, j; i <= n; ++i)
{
for(j = k, swaps = 0; j >= 1; --j)
if(min(a[i], b[i]) <= t[j] && t[j] < max(a[i], b[i]))
{
swaps += (a[i] < b[i]);
break;
}
swaps += get(pseg[k], max(a[i], b[i]) - 1) - get(pseg[j], max(a[i], b[i]) - 1);
ans += (swaps % 2 ? b[i] : a[i]);
}
printf("%lld\n", ans);
}
