/*

name:Domagoj Cevid

school:V.gimnazija

Contest division:Junior Division

Round:3

*/

#include <cstdio>

#include <algorithm>

using namespace std;

int solution[5];

int main(void){

for(int k=0;k<5;++k){

char field[31];

int coordinate;

int rod;

memset(field,'.',sizeof(field));

int n;

scanf("%d",&n);

for(int i=0;i<n;++i)

if(i!=0){

int a;

scanf("%d",&a);

field[a]='c';

}

else

scanf("%d",&coordinate);

int m;

scanf("%d",&m);

for(int j=0;j<m;++j){

int a;

scanf("%d",&a);

field[a]='b';

}

scanf("%d",&rod);

bool done=false;

if(coordinate==30){

if(rod==1)

solution[k]=-1;

else

solution[k]=-2;

done=true;

}

if(coordinate==29){

if(rod==2)

solution[k]=-1;

if(rod==1){

if(field[coordinate+rod]!='c')

solution[k]=30;

if(field[coordinate+rod]=='c')

solution[k]=-2;

}

if(rod>2)

solution[k]=-2;

done=true;}

if(coordinate==28){

if(rod==3)

solution[k]=-1;

if(rod==1 || rod==2){

if(field[coordinate+rod]!='c')

solution[k]=coordinate+rod;

if(field[coordinate+rod]=='c')

solution[k]=-2;

}

done=true;

if(rod>3)

solution[k]=-2;

}

if(coordinate==27){

if(rod==4)

solution[k]=-1;

if(rod==1 || rod==2 || rod==3){

if(field[coordinate+rod]!='c')

solution[k]=coordinate+rod;

if(field[coordinate+rod]=='c')

solution[k]=-2;

}

done=true;

if(rod==5)

solution[k]=-2;

}

if(coordinate<26 && coordinate+rod>=26){

if(field[26]=='c')

solution[k]=-2;

if(field[26]!='c')

solution[k]=26;

done=true;}

if(coordinate==26 && rod==1){

if(field[15]=='c' && field[27]=='c')

solution[k]=-2;

if(field[15]=='c' && field[27]!='c')

solution[k]=27;

if(field[15]!='c' && field[27]=='c')

solution[k]=-2;

if(field[15]!='c' && field[27]!='c')

solution[k]=15;

done=true;}

if(done==false){

if(field[coordinate+rod]!='c')

solution[k]=coordinate+rod;

if(field[coordinate+rod]=='c')

solution[k]=-2;

}

}

for(int i=0;i<5;++i){

if(solution[i]==-1)

printf("DONE\n");

if(solution[i]==-2)

printf("CANNOT MOVE\n");

if(solution[i]>0)

printf("%d\n",solution[i]);

}

scanf("%%");

return 0;

}