#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 arr[300][300];
int main() {
  std::cin.tie(0);
  std::ios::sync_with_stdio(false);
  int n, m, x, y, suma = 0, sumb = 0;
  vector<int> a, b;
  cin >> n >> m;
  Dinic solve(800);
  for (int i = 0; i < n; i++) {
    cin >> x;
    suma += x;
    a.push_back(x);
  }
  for (int i = 0; i < n; i++) {
    cin >> x;
    sumb += x;
    b.push_back(x);
  }
  for (int i = 0; i < m; i++) {
    cin >> x >> y;
    solve.AddEdge(x, n + y, 50000);
    solve.AddEdge(y, n + x, 50000);
  }
  for (int i = 1; i <= n; i++) {
    solve.AddEdge(0, i, a[i - 1]);
    solve.AddEdge(i, n + i, 50000);
    solve.AddEdge(n + i, n * 2 + 1, b[i - 1]);
  }
  int answer = solve.GetMaxFlow(0, n * 2 + 1);
  if (answer != sumb || sumb != suma) {
    cout << "NO" << endl;
  } else {
    cout << "YES" << endl;
    for (int i = 1; i <= n; i++) {
      for (int h = 0; h < solve.G[i].size(); h++) {
        if (solve.G[i][h].to > n && solve.G[i][h].flow >= 0)
          arr[solve.G[i][h].from][solve.G[i][h].to - n] = solve.G[i][h].flow;
      }
    }
    for (int i = 1; i <= n; i++) {
      for (int h = 1; h <= n; h++) {
        cout << arr[i][h] << " ";
      }
      cout << endl;
    }
  }
  return 0;
}
