A very troublesome and difficult DP for me
to[i][j]=represents the constituency from avenue i to avenue j
DP derivation
DP(i,j)=max{dp(i-1,k)+to(k,j)}
DP(i,j) The i-th line to be selected is on the j-th avenue, how many constituencies are below
That is, the previous line enumerates to the j-th avenue + to(the previous enumerated position to j)
After all lines have run once, take the maximum value, which is optimization
//
// GGGGGGGGGGGGG CCCCCCCCCCCCC AAA
// GGG::::::::::::G CCC::::::::::::C A:::A
// GG:::::::::::::::G CC:::::::::::::::C A:::::A
// G:::::GGGGGGGG::::G C:::::CCCCCCCC::::C A:::::::A
// G:::::G GGGGGG C:::::C CCCCCC A:::::::::A
//G:::::G C:::::C A:::::A:::::A
//G:::::G C:::::C A:::::A A:::::A
//G:::::G GGGGGGGGGGC:::::C A:::::A A:::::A
//G:::::G G::::::::GC:::::C A:::::A A:::::A
//G:::::G GGGGG::::GC:::::C A:::::AAAAAAAAA:::::A
//G:::::G G::::GC:::::C A:::::::::::::::::::::A
// G:::::G G::::G C:::::C CCCCCC A:::::AAAAAAAAAAAAA:::::A
// G:::::GGGGGGGG::::G C:::::CCCCCCCC::::C A:::::A A:::::A
// GG:::::::::::::::G CC:::::::::::::::C A:::::A A:::::A
// GGG::::::GGG:::G CCC::::::::::::C A:::::A A:::::A
// GGGGGG GGGG CCCCCCCCCCCCCAAAAAAA AAAAAAA
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
#include <ctime>
using namespace std;
#ifdef DEBUG
#define VAR(a,b) decltype(b) a=(b)
#define debug(...) printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)
#define gettime() end\_time=clock();printf("now running time is %.7f\\n",(float)(end\_time - start\_time)/CLOCKS\_PER\_SEC);
#else
#define VAR(a,b) \_\_typeof(b) a=(b)
#define debug(...)
#define gettime()
#endif
typedef unsigned int uint;
typedef long long int Int;
typedef unsigned long long int UInt;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\\n")
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()
#define De(x)printf(#x"%d\\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\
printf("%d ",dp\[htx\]\[hty\]);}Pln();}
#define M 205
#define PII pair<int,int\>
#define PB push\_back
#define oo INT\_MAX
#define Set\_oo 0x3f
#define FOR(a,b) for(VAR(a,(b).begin());a!=(b).end();++a)
#define eps 1e-6
clock\_t start\_time=clock(), end\_time;
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int n;
bool mz\[M\]\[M\];
int snum;
int st\[M\];
int needav;
int to\[M\]\[M\];
int dto\[M\]\[M\];
int dp\[M\]\[M\];
int prv\[M\]\[M\];
struct nbhs{
int x,y;
}nbh\[M\*M\];
void print(int i,int x){
if(x!=1&&i>=1){
print(i-1,prv\[i\]\[x\]);
}
printf(" %d",x);
}
void solve(){
Set(to,0);
Set(dto,0);
for(int i=0;i<n;i++){
// mz\[nbh\[i\].x\]\[nbh\[i\].y\]=0;
for(int j=snum-1;j>=0;j--){
if(st\[j\]<=nbh\[i\].x){
mz\[st\[j\]\]\[nbh\[i\].y+1\]=1;
// printf("%d %d\\n",st\[j\],nbh\[i\].y+1);
break;
}
}
}
// for(int i=1;i<=100;i++){
// for(int j=1;j<=100;j++)printf("%d",mz\[j\]\[i\]);
// Pln();
// }
for(int i=1;i<=100;i++){
for(int j=i+1;j<=100;j++){
to\[i\]\[j\]=to\[i\]\[j-1\];
for(int k=0;k<snum;k++){
if(!dto\[i\]\[k\]&&mz\[st\[k\]\]\[j\]){
to\[i\]\[j\]+=mz\[st\[k\]\]\[j\];
dto\[i\]\[k\]=1;
}
}
// debug("%d %d %d\\n",i,j,to\[i\]\[j\]);
}
}
Set(dp,-1);
Set(prv,-1);
for(int i=2;i<=100;i++){
dp\[1\]\[i\]=to\[1\]\[i\];
prv\[1\]\[i\]=1;
}
for(int i=2;i<needav;i++){
for(int j=i+1;j<=100;j++){
for(int k=i;k<j;k++){
if(dp\[i\]\[j\]<dp\[i-1\]\[k\]+to\[k\]\[j\]){
dp\[i\]\[j\]=dp\[i-1\]\[k\]+to\[k\]\[j\];
prv\[i\]\[j\]=k;
}
}
}
}
// debug("%d\\n",dp\[needav-1\]\[100\]);
printf("%d",needav);
// for(int i=100,j=needav-1;i!=1&&j>=1;i=prv\[j\]\[i\])
// printf("%d %d\\n",i,j);
print(needav-1,100);
}
int main() {
ios\_base::sync\_with\_stdio(0);
while(~scanf("%d",&n)&&n>=0){
Set(mz,0);
for(int i=0;i<n;i++){
int x,y;
scanf("%d%d",&x,&y);
nbh\[i\].x=x;
nbh\[i\].y=y;
// mz\[x\]\[y\]=1;
}
scanf("%d",&snum);
for(int i=0;i<snum;i++)scanf("%d",&st\[i\]);
scanf("%d",&needav);
solve();
Pln();
}
}