#include <bits/stdc++.h>
using namespace std;
template <int POS, class TUPLE>
void deploy(std::ostream &os, const TUPLE &tuple) {}
template <int POS, class TUPLE, class H, class... Ts>
void deploy(std::ostream &os, const TUPLE &t) {
  os << (POS == 0 ? "" : ", ") << get<POS>(t);
  deploy<POS + 1, TUPLE, Ts...>(os, t);
}
template <class T, class U>
std::ostream &operator<<(std::ostream &os, std::pair<T, U> &p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
template <class T>
std::ostream &operator<<(std::ostream &os, std::vector<T> &v) {
  int remain = v.size();
  os << "{";
  for (auto e : v) os << e << (--remain == 0 ? "}" : ", ");
  return os;
}
template <class T>
std::ostream &operator<<(std::ostream &os, std::set<T> &v) {
  int remain = v.size();
  os << "{";
  for (auto e : v) os << e << (--remain == 0 ? "}" : ", ");
  return os;
}
template <class T, class K>
std::ostream &operator<<(std::ostream &os, std::map<T, K> &make_pair) {
  int remain = make_pair.size();
  os << "{";
  for (auto e : make_pair)
    os << "(" << e.first << " -> " << e.second << ")"
       << (--remain == 0 ? "}" : ", ");
  return os;
}
using ll = long long;
int N, M;
ll K;
ll nums[110][110];
ll A[110];
ll B[110];
int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cin >> N >> M;
  for (int i = 0; i < (N); i++) {
    for (int j = 0; j < (M); j++) {
      cin >> nums[i][j];
    }
  }
  int min_i = 0;
  int min_j = 0;
  ll min_num = nums[0][0];
  ll max_num = 0;
  for (int i = 0; i < (N); i++) {
    for (int j = 0; j < (M); j++) {
      if (nums[i][j] < min_num) {
        min_i = i;
        min_j = j;
        min_num = nums[i][j];
      }
      max_num = max(nums[i][j], max_num);
    }
  }
  if (max_num >= 1e18) {
    cout << "NO\n";
    return 0;
  } else {
    K = 1e18;
  }
  for (int i = 0; i < (N); i++) {
    A[i] = nums[i][min_j];
  }
  for (int j = 0; j < (M); j++) {
    B[j] = nums[min_i][j] - min_num;
  }
  B[min_j] = 0;
  bool OK = true;
  for (int i = 0; i < (N); i++) {
    for (int j = 0; j < (M); j++) {
      if (nums[i][j] != A[i] + B[j]) {
        K = A[i] + B[j] - nums[i][j];
        OK = false;
        goto breaking;
      }
    }
  }
breaking:
  if (OK) {
    goto output;
  }
  { std::cerr << ("K") << "=" << (K) << "\n"; };
  if (K < 0) {
    cout << "NO\n";
    return 0;
  }
  OK = true;
  for (int i = 0; i < (N); i++) {
    for (int j = 0; j < (M); j++) {
      if (nums[i][j] != ((A[i] + B[j]) % K)) {
        OK = false;
      }
    }
  }
  if (!OK) {
    cout << "NO\n";
    return 0;
  }
output:
  cout << "YES\n";
  cout << K << "\n";
  for (int i = 0; i < (N); i++) {
    cout << A[i] << " ";
  }
  cout << "\n";
  for (int j = 0; j < (M); j++) {
    cout << B[j] << " ";
  }
  cout << "\n";
  return 0;
}
