#include <bits/stdc++.h>
using namespace std;
const int N = 20009;
int INF = 2e9;
struct edge {
  int to, cap, rev;
  edge() {}
  edge(int tt, int cc, int rr) {
    to = tt;
    cap = cc;
    rev = rr;
  }
};
vector<edge> Graph[N];
int level[N];
int iter[N];
void add_edge(int from, int to, int cap) {
  Graph[from].push_back(edge(to, cap, Graph[to].size()));
  Graph[to].push_back(edge(from, 0, Graph[from].size() - 1));
}
void bfs(int s) {
  memset(level, -1, sizeof(level));
  queue<int> que;
  level[s] = 0;
  que.push(s);
  while (que.size()) {
    int v = que.front();
    que.pop();
    for (int i = 0; i < Graph[v].size(); i++) {
      edge &e = Graph[v][i];
      if (e.cap > 0 && level[e.to] < 0) {
        level[e.to] = level[v] + 1;
        que.push(e.to);
      }
    }
  }
}
int dfs(int v, int t, int f) {
  if (v == t) return f;
  for (int &i = iter[v]; i < Graph[v].size(); i++) {
    edge &e = Graph[v][i];
    if (e.cap > 0 && level[v] < level[e.to]) {
      int d = dfs(e.to, t, min(f, e.cap));
      if (d > 0) {
        e.cap -= d;
        Graph[e.to][e.rev].cap += d;
        return d;
      }
    }
  }
  return 0;
}
int max_flow(int s, int t) {
  int flow = 0;
  while (1) {
    bfs(s);
    if (level[t] < 0) return flow;
    memset(iter, 0, sizeof(iter));
    int f;
    while ((f = dfs(s, t, INF)) > 0) {
      flow += f;
    }
  }
  return flow;
}
int a[105], b[105], res[105][105], SumIn, SumOut;
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++)
    scanf("%d", &a[i]), add_edge(0, i + 1, a[i]), SumIn += a[i];
  for (int i = 0; i < n; i++)
    scanf("%d", &b[i]), add_edge(i + 1 + n, 2 * n + 1, b[i]), SumOut += b[i];
  for (int i = 0; i < n; i++) add_edge(i + 1, i + 1 + n, 1e6);
  for (int i = 0; i < m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    add_edge(u, v + n, 1e6);
    add_edge(v, u + n, 1e6);
  }
  if (SumIn != SumOut || SumIn != max_flow(0, 2 * n + 1))
    return 0 * printf("NO\n");
  printf("YES\n");
  for (int i = 1; i <= n; i++)
    for (auto &e : Graph[i])
      if (e.to > n) res[i - 1][e.to - n - 1] = Graph[e.to][e.rev].cap;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) printf("%d ", res[i][j]);
    printf("\n");
  }
  return 0;
}
