import java.util.*;
import java.io.*; 
import java.text.*;
//Solution Credits: Taranpreet Singh
public class Main{
    //SOLUTION BEGIN
    void solve(int TC) throws Exception{
        int n = ni(), m = ni();
        int[][] A = new int[n+m][], C = new int[n][m];
        for(int i = 0; i< n+m; i++)A[i] = new int[]{ni(), ni()};
        int[][] set = new int[n+m][];
        for(int i = 0; i< n+m; i++)set[i] = new int[]{i, 0};
        boolean yes = true;
        for(int i = 0; i< n; i++)
            for(int j = 0; j< m; j++){
                C[i][j] = ni();
                if(C[i][j]!=-1){
                    if(find(set, i)!=find(set, j+n))union(set, i, j+n, C[i][j]);
                    else if((set[i][1]^set[j+n][1])!=C[i][j])yes = false;
                }
            }
        if(!yes){pn("NO");return;}
        int[] nxt = new int[n+m], prev = new int[n+m];
        Arrays.fill(nxt, -1);Arrays.fill(prev, -1);
        for(int i = n+m-1; i>= 0; i--){
            if(prev[find(set, i)]!=-1)nxt[i] = prev[find(set, i)];
            prev[find(set, i)] = i;
        }
        int[] xor = new int[n+m], ans = new int[n+m];
        int[][][] lim = new int[B+1][n+m][2];
        for(int i = 0; i< n+m; i++)lim[B][i] = new int[]{A[i][0], A[i][1]};
        for(int i = 0; i< n+m; i++)xor[i] = set[i][1];
        for(int i = 0; i< n+m; i++){
            if(prev[i]==-1)continue;
            if(xor[i]!=0)throw new Exception("Hold Right There, Sparky!");
            yes &= solve(lim, nxt, xor, i, B-1);
            for(int j = i; j!=-1 && yes; j = nxt[j]){
                if(lim[0][j][0]!=lim[0][j][1])throw new Exception("Hold Right There, Sparky!");
                ans[j] = lim[0][j][0];
            }
        }
        if(yes){
            pn("YES");
            for(int i = 0; i< n; i++)p(ans[i]+" ");pn("");
            for(int i = 0; i< m; i++)p(ans[i+n]+" ");pn("");
        }else pn("NO");
    }
    int B = 30, all = (1<<B)-1;
    boolean solve(int[][][] lim, int[] nxt, int[] xor, int pos, int bit) throws Exception{
        if(bit==-1)return true;
        for(int c = 0; c< 2; c++){
            boolean flag = true;
            for(int i = pos; i!= -1; i = nxt[i]){
                int bi = c^((xor[i]>>bit)&1);
                int x = lim[bit+1][i][0]&(all^((1<<(1+bit))-1));
                int le = x|(bi<<bit), ri = x|(bi<<bit)|((1<<bit)-1);
                if(le>lim[bit+1][i][1] || ri< lim[bit+1][i][0])flag = false;
            }
            if(flag){
                for(int i = pos; i!=-1; i = nxt[i]){
                   int bi = c^((xor[i]>>bit)&1);
                    int x = lim[bit+1][i][0]&(all^((1<<(1+bit))-1));
                    int le = x|(bi<<bit), ri = x|(bi<<bit)|((1<<bit)-1);
                    lim[bit][i][0] = Math.max(lim[bit+1][i][0], le);
                    lim[bit][i][1] = Math.min(lim[bit+1][i][1], ri);
                }
                if(solve(lim, nxt, xor, pos, bit-1))return true;
            }
        }
        
        return false;
    }
    int find(int[][] set, int u){
        if(set[u][0]!=u){
            int p = set[u][0], val = set[u][1];
            set[u][0] = find(set, set[u][0]);
            set[u][1] = set[p][1]^val;
        }
        return set[u][0];
    }
    void union(int[][] set, int u, int v, int val){
        int px = set[u][1], py = set[v][1];
        u = find(set, u); v = find(set, v);
        if(u!=v)set[Math.max(u,v)] = new int[]{Math.min(u,v), px^py^val};
    }
    //SOLUTION END
    long mod = (long)1e9+7, IINF = (long)5e18;
    final int INF = (int)2e9, MAX = (int)2e5+1;
    DecimalFormat df = new DecimalFormat("0.000000000");
    double PI = 3.1415926535897932384626433832792884197169399375105820974944, eps = 1e-8;
    static boolean multipleTC = true, memory = false;
    FastReader in;PrintWriter out;
    void run() throws Exception{
        in = new FastReader();
        out = new PrintWriter(System.out);
        int T = (multipleTC)?ni():1;
        //Solution Credits: Taranpreet Singh
        for(int i = 1; i<= T; i++)solve(i);
        out.flush();
        out.close();
    }
    public static void main(String[] args) throws Exception{
        if(memory)new Thread(null, new Runnable() {public void run(){try{new Main().run();}catch(Exception e){e.printStackTrace();}}}, "1", 1 << 28).start();
        else new Main().run();
    }
    long gcd(long a, long b){return (b==0)?a:gcd(b,a%b);}
    int gcd(int a, int b){return (b==0)?a:gcd(b,a%b);}
    int bit(long n){return (n==0)?0:(1+bit(n&(n-1)));}
    void p(Object o){out.print(o);}
    void pn(Object o){out.println(o);}
    void pni(Object o){out.println(o);out.flush();}
    String n(){return in.next();}
    String nln(){return in.nextLine();}
    int ni(){return Integer.parseInt(in.next());}
    long nl(){return Long.parseLong(in.next());}
    double nd(){return Double.parseDouble(in.next());}

    class FastReader{
        BufferedReader br;
        StringTokenizer st;
        public FastReader(){
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        public FastReader(String s) throws Exception{
            br = new BufferedReader(new FileReader(s));
        }

        String next(){
            while (st == null || !st.hasMoreElements()){
                try{
                    st = new StringTokenizer(br.readLine());
                }catch (IOException  e){
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        String nextLine(){
            String str = "";
            try{    
                str = br.readLine();
            }catch (IOException e){
                e.printStackTrace();
            }   
            return str;
        }
    }
}