#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 5;
const long long lim = 1e9;
long long n, m, s, t, c[N][N], trace[N], f[N][N], maxflow = 0, tmp = 0,
                                                  suma = 0, sumb = 0;
vector<int> a[100005];
void BFS(int i) {
  queue<int> q;
  q.push(i);
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    for (int j = 0; j < a[u].size(); j++) {
      int v = a[u][j];
      if (trace[v] == 0 && c[u][v] > f[u][v]) {
        trace[v] = u;
        q.push(v);
      }
    }
  }
}
bool Findpath() {
  memset(trace, 0, sizeof(trace));
  trace[s] = -1;
  BFS(s);
  return (trace[t]);
}
void IncFlow() {
  tmp++;
  long long delta = lim;
  int v = t;
  while (v != s) {
    int u = trace[v];
    delta = min(delta, c[u][v] - f[u][v]);
    v = u;
  }
  v = t;
  while (v != s) {
    int u = trace[v];
    f[u][v] += delta;
    f[v][u] -= delta;
    v = u;
  }
  maxflow += delta;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m;
  s = 2 * n + 2;
  t = 2 * n + 1;
  for (int i = 1; i <= n; i++) {
    int x;
    cin >> x;
    suma += x;
    a[s].push_back(i);
    a[i].push_back(s);
    c[s][i] = x;
  }
  for (int i = 1; i <= n; i++) {
    int x;
    cin >> x;
    sumb += x;
    a[i + n].push_back(t);
    a[t].push_back(i + n);
    c[i + n][t] = x;
  }
  for (int i = 1; i <= n; i++) {
    c[i][i + n] = lim;
    a[i].push_back(i + n);
    a[i + n].push_back(i);
  }
  for (int i = 1; i <= m; i++) {
    int u, v;
    cin >> u >> v;
    a[u].push_back(v + n);
    a[v].push_back(u + n);
    a[u + n].push_back(v);
    a[v + n].push_back(u);
    c[u][v + n] = lim;
    c[v][u + n] = lim;
  }
  while (Findpath()) IncFlow();
  if (maxflow == sumb && suma == sumb) {
    cout << "YES" << endl;
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= n; j++) {
        cout << f[i][j + n] << " ";
      }
      cout << endl;
    }
  } else {
    cout << "NO";
  }
}
