#include<bits/stdc++.h>
using namespace std;
long long top=1,n,m,a[200010],ans;
struct abc{
    long long x;
    long long y;
    bool operator<(abc z)const{
        return y>z.y;
    }
};
abc b[200010];
priority_queue<abc>q ;
bool cmp(abc A,abc B){
   return A.x<B.x;
}
int main(){
    freopen("dream.in","r",stdin);
    freopen("dream.out","w",stdout);
    cin>>n>>m;
    for(long long i=1;i<=n;i++)
    cin>>b[i].x>>b[i].y;
    for(long long i=1;i<=m;i++)
    cin>>a[i];
    sort(b+1,b+n+1,cmp);
    sort(a+1,a+m+1);
    for(long long i=1;i<=m;i++)
    cout<<a[i]<<endl;
    for(long long i=1;i<=m;i++){
        while(top<=n&&a[i]-b[top].x>=0){
            q.push(b[top]);
            top++;
        }
        while(!q.empty()&&q.top().y<a[i])
        q.pop();
        if(!q.empty()){
            ans++;
            q.pop();
        }
    }
    cout<<ans;
    return 0;
}