#include<bits/stdc++.h>
using namespace std;
#ifndef BADGNU
#pragma GCC target("sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#endif
#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define int ll
#define ld long double
#define y1 cheza
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
template<class T> using ordered_multiset = tree<T,null_type,less_equal<T>,rb_tree_tag,tree_order_statistics_node_update>;
const int N=1e5+100;
const int M=5001;
const int B=447;
const int mod=998244353;
const ll INF=1e18;
const int dx[]={1,-1,0,0};
const int dy[]={0,0,1,-1};
const double eps=1e-6;
bool check(int x,int y){
if(x<0||y<0||x>4000||y>4000)return 0;
return 1;
}
int n,q;
pair<int,int>a[N],b[N];
void test(){
cin>>n>>q;
vector<int>v;
for(int i=1;i<=n;i++){
cin>>a[i].first>>a[i].second;
v.push_back(a[i].first);
b[i]=a[i];
}
sort(v.begin(),v.end());
v.resize(unique(v.begin(),v.end())-v.begin());
for(int t;q--;){
cin>>t;
if(t==0){
cout<<v.size()<<'\n';
continue;
}
int ans=0;
for(int i=1;i<=n;i++){
a[i]=b[i];
// a[i].first-=t;
a[i].second+=t;
}
sort(a+1,a+n+1);
int last=-1e12;
for(int i=1;i<=n;i++){
ans+=(a[i].second-max(a[i].first,last)+1)*2;
last=a[i].second+1;
// cout<<a[i].first<<' '<<a[i].second<<'\n';
}
last=-1e12;
int res=0;
int cur=0;
for(int i=1;i<=n;i++){
if(last<a[i].first){
res+=(t-1);
cur++;
}
if(last==a[i].first){
res+=(t-1);
}
last=a[i].second;
}
ans=(ans+cur*(t-1)+res);
cout<<ans<<'\n';
}
}
/*
*/
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
// cout.tie(nullptr);
int t2=1;
// cin>>t2;
for(int i=1;i<=t2;i++){
test();
}
}
