#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 n, m;
vector<int> cur(105), tar(105);
int main() {
  scanf("%d%d", &n, &m);
  int curcntr = 0, tarcntr = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &cur[i]);
    curcntr += cur[i];
  }
  for (int i = 1; i <= n; i++) {
    scanf("%d", &tar[i]);
    tarcntr += tar[i];
  }
  int x, y;
  Dinic D(2 * n + 3);
  for (int i = 0; i < m; i++) {
    scanf("%d%d", &x, &y);
    D.AddEdge(x, y + n, INF);
    D.AddEdge(y, x + n, INF);
  }
  int s = 0, e = 2 * n + 1;
  for (int i = 1; i <= n; i++) {
    D.AddEdge(i, i + n, INF);
    D.AddEdge(s, i, cur[i]);
    D.AddEdge(i + n, e, tar[i]);
  }
  if (curcntr != tarcntr || curcntr != D.GetMaxFlow(s, e)) {
    printf("NO\n");
    return 0;
  }
  int res[105][105];
  puts("YES");
  memset(res, 0, sizeof res);
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < D.G[i].size(); j++) {
      Edge ed = D.G[i][j];
      int to = ed.to, from = ed.from, flow = ed.flow;
      if (to == from || to == e || from == s) continue;
      if (to > n) to -= n;
      if (from > n) from -= n;
      res[from - 1][to - 1] = flow;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (j) printf(" ");
      printf("%d", res[i][j]);
    }
    printf("\n");
  }
  return 0;
}
