#include <iostream>

#include <cstdio>

#include <cstring>

#include <algorithm>

#include <cmath>

using namespace std;

typedef long long ll;

const int N=,M=;

inline int read(){

    char c=getchar();int x=,f=;

    while(c<''||c>''){if(c=='-')f=-;c=getchar();}

    while(c>=''&&c<=''){x=x*+c-'';c=getchar();}

    return x*f;

}

int n,a[N],m,b[N];

int sg[M],vis[M];

int dfs(int u){//printf("dfs %d\n",u);

    if(sg[u]!=-) return sg[u];//printf("y\n");

    bool vis[N];memset(vis,,sizeof(vis));

    for(int i=;i<=m && b[i]<=u;i++) vis[dfs(u-b[i])]=;

    for(int i=;;i++) if(!vis[i]) {sg[u]=i;break;}

    return sg[u];

}

int main(){

    //freopen("in","r",stdin);

    memset(sg,-,sizeof(sg));sg[]=;

    n=read();

    for(int i=;i<=n;i++) a[i]=read();

    m=read();

    for(int i=;i<=m;i++) b[i]=read();

    sort(b+,b++m);

    int sum=;

    for(int i=;i<=n;i++) sum^=dfs(a[i]);

    if(sum!=){

        puts("YES");

        int flag=;

        for(int i=;i<=n && !flag;i++)

            for(int j=;j<=m && b[j]<=a[i];j++)

                if( ( sum^dfs(a[i])^dfs(a[i]-b[j]) )== ) {printf("%d %d\n",i,b[j]);flag=;break;}

    }else puts("NO");

}