/*
 * Solution Template for Mundane Square
 * 
 * Australian Informatics Olympiad 2026
 * 
 * This file is provided to assist with reading of input and writing of output
 * for the problem. You may modify this file however you wish, or
 * you may choose not to use this file at all.
 */

#include <stdio.h>

/* N is the grid size and K is the maximum value in a cell. */
int N;
long long K;
/* R and C contain the target row and column sums. The arrays start from 0. */
long long R[1005];
long long C[1005];

int main(void) {
  int i;

  /* Read N, K, and the target row and column sums. */
  scanf("%d%lld", &N, &K);
  for (i = 0; i < N; i++) {
    scanf("%lld", &R[i]);
  }
  for (i = 0; i < N; i++) {
    scanf("%lld", &C[i]);
  }

  /*
   * Please note that the answer may exceed the maximum value
   * that can be stored in an "int" integer type.
   * Because of this, you should use the "long long" integer type
   * instead of "int" when computing your solution.
   */
  /*
   * TODO: Determine whether a mundane square exists. Output NO if it does not;
   * otherwise output YES followed by a valid N by N grid. An example NO output
   * is shown below.
   */
  printf("NO\n");

  return 0;
}