计算（线段树维护DP）

$\mathrm{A}\mathrm{C}\mathrm{C}\mathrm{o}\mathrm{d}\mathrm{e}$

#include<bits/stdc++.h>
#define maxn 500005
#define maxv maxn * 4
#define mod 1000000009
#define lc u<<1
#define rc u<<1|1
#define rep(i,j,k) for(int i=(j),LIM=(k);i<=LIM;i++)
using namespace std;

char cb[1<<16],*cs=cb,*ct=cb;
#define getc() (cs==ct&&(ct=(cs=cb)+fread(cb,1,1<<16,stdin),cs==ct)?0:*cs++)
void read(int &res){char ch;
	for(;!isdigit(ch=getc()););
	for(res=ch-'0';isdigit(ch=getc());res=res*10+ch-'0');
}
int n,m,X[maxn],L[maxn],R[maxn],sb[maxv],c[maxn];
int& upd(int &x){ return x+=x>>31&mod; }
int sm[maxv],ml[maxv];
void dtp(int u,int p){ ml[u]=p*1ll*ml[u]%mod,sm[u]=p*1ll*sm[u]%mod; }
void dt(int u){ if(ml[u]^1) dtp(lc,ml[u]),dtp(rc,ml[u]),ml[u]=1; }
void dbl(int u,int l,int r,int ql,int qr){
	if(l>qr||ql>r) return;
	if(ql<=l&&r<=qr) return (void)(dtp(u,2));
	int m=l+r>>1;dt(u);
	dbl(lc,l,m,ql,qr),dbl(rc,m+1,r,ql,qr);
	upd(sm[u]=sm[lc]+sm[rc]-mod);
}
int qry(int u,int l,int r,int ql,int qr){
	if(l>qr||ql>r) return 0;
	if(ql<=l&&r<=qr) return sm[u];
	int m=l+r>>1;dt(u);
	return (qry(lc,l,m,ql,qr)+qry(rc,m+1,r,ql,qr))%mod;
}
void ins(int u,int l,int r,int p,int v){
	if(l==r) return (void)(sm[u]=(sm[u]+v)%mod);
	int m=l+r>>1;dt(u);p<=m?ins(lc,l,m,p,v):ins(rc,m+1,r,p,v);
	upd(sm[u]=sm[lc]+sm[rc]-mod);
}
bool cmp(const int &u,const int &v){ return L[u]^L[v]?L[u]<L[v]:R[u]<R[v]; }

int main(){
	
	freopen("calculating.in","r",stdin);
	freopen("calculating.out","w",stdout);
	read(n),read(m);
	rep(i,1,n) read(L[i]),read(R[i]),c[i]=i;
	rep(i,1,m) read(X[i]),sb[++sb[0]]=X[i];
	sort(sb+1,sb+1+sb[0]);
	sb[0]=unique(sb+1,sb+1+sb[0])-sb-1;
	sort(X+1,X+1+m);
	rep(i,1,m) X[i]=lower_bound(sb+1,sb+1+sb[0],X[i])-sb;
	sort(c+1,c+1+n,cmp);
	fill(ml,ml+4*n,1);
	ins(1,0,sb[0],0,1);
	rep(i,1,n){ 
		int u=c[i];
		L[u]=lower_bound(sb+1,sb+1+sb[0],L[u])-sb , R[u]=upper_bound(sb+1,sb+1+sb[0],R[u])-sb-1;
		ins(1,0,sb[0],R[u],qry(1,0,sb[0],L[u]-1,R[u])),dbl(1,0,sb[0],R[u]+1,sb[0]);
	}
	printf("%d\n",qry(1,0,sb[0],sb[0],sb[0]));
}