#include <bits/stdc++.h>
using namespace std;
const int INF = 2000000000;
struct Edge {
  int from, to, cap, flow, index;
  Edge(int from, int to, int cap, int flow, int index)
      : from(from), to(to), cap(cap), flow(flow), index(index) {}
};
struct Dinic {
  int N;
  vector<vector<Edge> > G;
  vector<Edge *> dad;
  vector<int> Q;
  Dinic(int N) : N(N), G(N), dad(N), Q(N) {}
  void AddEdge(int from, int to, int cap) {
    G[from].push_back(Edge(from, to, cap, 0, G[to].size()));
    if (from == to) G[from].back().index++;
    G[to].push_back(Edge(to, from, 0, 0, G[from].size() - 1));
  }
  long long BlockingFlow(int s, int t) {
    fill(dad.begin(), dad.end(), (Edge *)NULL);
    dad[s] = &G[0][0] - 1;
    int head = 0, tail = 0;
    Q[tail++] = s;
    while (head < tail) {
      int x = Q[head++];
      for (int i = 0; i < G[x].size(); i++) {
        Edge &e = G[x][i];
        if (!dad[e.to] && e.cap - e.flow > 0) {
          dad[e.to] = &G[x][i];
          Q[tail++] = e.to;
        }
      }
    }
    if (!dad[t]) return 0;
    long long totflow = 0;
    for (int i = 0; i < G[t].size(); i++) {
      Edge *start = &G[G[t][i].to][G[t][i].index];
      int amt = INF;
      for (Edge *e = start; amt && e != dad[s]; e = dad[e->from]) {
        if (!e) {
          amt = 0;
          break;
        }
        amt = min(amt, e->cap - e->flow);
      }
      if (amt == 0) continue;
      for (Edge *e = start; amt && e != dad[s]; e = dad[e->from]) {
        e->flow += amt;
        G[e->to][e->index].flow -= amt;
      }
      totflow += amt;
    }
    return totflow;
  }
  long long GetMaxFlow(int s, int t) {
    long long totflow = 0;
    while (long long flow = BlockingFlow(s, t)) totflow += flow;
    return totflow;
  }
};
int A[200], B[200], sum1, sum2;
int ans[200][200];
int main() {
  int n;
  int e, i, j, sink, source, flow, a, b, c;
  while (cin >> n >> e) {
    source = 0;
    sink = 2 * n + 1;
    sum1 = sum2 = flow = 0;
    Dinic din(2 * n + 10);
    for (i = 1; i <= n; i++) {
      scanf("%d", &A[i]);
      sum1 += A[i];
      din.AddEdge(source, i, A[i]);
      din.AddEdge(i, i + n, INF);
    }
    for (i = 1; i <= n; i++) {
      scanf("%d", &B[i]);
      sum2 += B[i];
      din.AddEdge(i + n, sink, B[i]);
    }
    for (i = 1; i <= e; i++) {
      scanf("%d %d", &a, &b);
      c = INF;
      din.AddEdge(a, b + n, INF);
      din.AddEdge(b, a + n, INF);
    }
    flow = din.GetMaxFlow(source, sink);
    int len;
    if (sum1 == sum2 and sum2 == flow) {
      cout << "YES" << endl;
      memset(ans, 0, sizeof ans);
      for (i = 1; i <= n; i++) {
        len = din.G[i].size();
        for (j = 0; j < len; j++) {
          a = din.G[i][j].to - n;
          if (a >= 1 and a <= n) {
            ans[i][a] = din.G[i][j].flow;
          }
        }
      }
      for (i = 1; i <= n; i++) {
        for (j = 1; j <= n; j++) {
          cout << ans[i][j] << " ";
        }
        cout << endl;
      }
    } else
      cout << "NO" << endl;
  }
  return 0;
}
