#include <bits/stdc++.h>
using namespace std;
int a[110], b[110];
int n, m;
namespace maxflow {
struct edge {
  int to, cap, rev;
  edge(int to = 0, int cap = 0, int rev = 0) : to(to), cap(cap), rev(rev) {}
};
vector<edge> g[222];
int level[222], iter[222];
int s, t;
void add_edge(int from, int to, int cap) {
  g[from].push_back(edge(to, cap, g[to].size()));
  g[to].push_back(edge(from, 0, g[from].size() - 1));
}
bool bfs() {
  memset(level, -1, sizeof(level));
  queue<int> q;
  q.push(s);
  level[s] = 0;
  while (!q.empty()) {
    int v = q.front();
    q.pop();
    for (int i = 0; i < g[v].size(); i++) {
      edge &e = g[v][i];
      if (e.cap && level[e.to] == -1) {
        level[e.to] = level[v] + 1;
        q.push(e.to);
      }
    }
  }
  return level[t] != -1;
}
int dfs(int v, int f) {
  if (v == t) return f;
  for (int &i = iter[v]; i < g[v].size(); i++) {
    edge &e = g[v][i];
    if (e.cap && level[e.to] == level[v] + 1) {
      int d = dfs(e.to, min(f, e.cap));
      if (d > 0) {
        e.cap -= d;
        g[e.to][e.rev].cap += d;
        return d;
      }
    }
  }
  return 0;
}
int max_flow() {
  int flow = 0, f = 0;
  while (bfs()) {
    memset(iter, 0, sizeof(iter));
    while (true) {
      f = dfs(s, 1000000000);
      if (f)
        flow += f;
      else
        break;
    }
  }
  return flow;
}
};  // namespace maxflow
int res[110][110];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  using namespace maxflow;
  int s1 = 0, s2 = 0;
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    s1 += a[i];
  }
  for (int i = 1; i <= n; i++) {
    cin >> b[i];
    s2 += b[i];
  }
  if (s1 != s2) {
    cout << "NO" << endl;
    return 0;
  }
  s = n + n + 1;
  t = n + n + 2;
  for (int i = 1; i <= n; i++) add_edge(s, i, a[i]);
  for (int i = 1; i <= n; i++) add_edge(i + n, t, b[i]);
  for (int i = 1; i <= n; i++) add_edge(i, i + n, 1e6);
  for (int i = 1; i <= m; i++) {
    int x, y;
    cin >> x >> y;
    add_edge(x, y + n, 1e6);
    add_edge(y, x + n, 1e6);
  }
  int flow = max_flow();
  if (flow != s1) {
    cout << "NO" << endl;
    return 0;
  }
  cout << "YES" << endl;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < g[i].size(); j++) {
      edge &e = g[i][j];
      if (e.to > n) {
        res[i][e.to - n] = g[e.to][e.rev].cap;
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      cout << res[i][j] << ' ';
    }
    cout << endl;
  }
  return 0;
}
