#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:640000000")
using namespace std;
const double eps = 1e-9;
const double pi = acos(-1.0);
const int inf = (int)1e9 + 10;
int f[222][222], c[222][222];
int ptr[222];
int lvl[222];
int n;
bool bfs() {
  memset(lvl, -1, sizeof(lvl));
  queue<int> q;
  lvl[0] = 0;
  q.push(0);
  while (!q.empty()) {
    int v = q.front();
    q.pop();
    for (int i = 0; i <= 2 * n + 1; i++)
      if (c[v][i] > f[v][i] && lvl[i] == -1) {
        lvl[i] = lvl[v] + 1;
        q.push(i);
      }
  }
  return lvl[2 * n + 1] != -1;
}
int dfs(int v, int flow) {
  if (flow == 0) return 0;
  if (v == 2 * n + 1) return flow;
  for (int &i = ptr[v]; i <= 2 * n + 1; i++)
    if (lvl[i] == lvl[v] + 1 && c[v][i] > f[v][i]) {
      if (int pushed = dfs(i, min(flow, c[v][i] - f[v][i]))) {
        f[v][i] += pushed;
        f[i][v] -= pushed;
        return pushed;
      }
    }
  return 0;
}
int main() {
  int m;
  cin >> n >> m;
  int sum = 0;
  for (int i = 1; i <= n; i++) {
    int x;
    cin >> x;
    sum += x;
    c[0][i] = x;
  }
  int sum2 = 0;
  for (int i = 1; i <= n; i++) {
    int x;
    cin >> x;
    sum2 += x;
    c[n + i][2 * n + 1] = x;
  }
  for (int i = 0; i < m; i++) {
    int x, y;
    cin >> x >> y;
    c[x][y + n] = inf;
    c[y][x + n] = inf;
  }
  for (int i = 1; i <= n; i++) {
    c[i][i + n] = inf;
  }
  int flow = 0;
  while (bfs()) {
    memset(ptr, 0, sizeof(ptr));
    while (int pushed = dfs(0, inf)) {
      flow += pushed;
    }
  }
  if (flow != sum || sum2 != flow) {
    cout << "NO" << endl;
    return 0;
  }
  cout << "YES" << endl;
  for (int i = 1; i <= n; i++) {
    for (int j = n + 1; j <= 2 * n; j++) {
      cout << max(f[i][j], 0) << " ";
    }
    cout << endl;
  }
  return 0;
}
