#include <bits/stdc++.h>
using namespace std;
void fun() {}
int md = 1e9 + 7;
int __gcd(int a, int b) {
  if (b == 0) return a;
  return __gcd(b, a % b);
}
int poww(int a, int b, int md) {
  if (b < 0) return 0;
  if (a == 0) return 0;
  int res = 1;
  while (b) {
    if (b & 1) {
      res = (1ll * res * a) % md;
    }
    a = (1ll * a * a) % md;
    b >>= 1;
  }
  return res;
}
int poww(int a, int b) {
  if (b < 0) return 0;
  if (a == 0) return 0;
  int res = 1;
  while (b) {
    if (b & 1) {
      res = (1ll * res * a);
    }
    a = (1ll * a * a);
    b >>= 1;
  }
  return res;
}
void ainp(int arr[], int n) {
  for (int i = 1; i <= n; i++) cin >> arr[i];
}
void disp(int arr[], int n) {
  for (int i = 1; i <= n; i++) cout << arr[i] << " ";
  cout << "\n";
}
void dispv(vector<int> &v) {
  for (int i = 0; i < v.size(); i++) cout << v[i] << " ";
  cout << "\n";
}
int divide(int a, int b, int md) {
  int rr = a * (poww(b, md - 2, md));
  rr %= md;
  return rr;
}
const int size = 2004;
char arr[size][size];
int ans[size];
vector<int> g[size];
int vis[size];
int parent[size];
int n, m;
void pre() {
  for (int i = 1; i < size; i++) parent[i] = i;
}
int findp(int node) {
  if (parent[node] == node) return node;
  return parent[node] = findp(parent[node]);
}
void unite(int par, int child) {
  par = findp(par), child = findp(child);
  if (par == child) return;
  parent[child] = par;
}
bool check(int par) {
  if (vis[par] == 2) return 0;
  if (vis[par] == 1) return 1;
  vis[par] = 1;
  for (int child : g[par])
    if (check(child)) return 1;
  vis[par] = 2;
  return 0;
}
bool checkloop() {
  for (int i = 1; i <= n + m; i++)
    if (!vis[findp(i)] && check(findp(i))) return 1;
  return 0;
}
void dfs(int par) {
  if (vis[par]) return;
  ans[par] = 1;
  vis[par] = 1;
  for (int child : g[par]) {
    dfs(child);
    ans[par] = max(ans[child] + 1, ans[par]);
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  fun();
  pre();
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      cin >> arr[i][j];
      if (arr[i][j] == '=') unite(i, j + n);
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      if (arr[i][j] == '>')
        g[findp(i)].push_back(findp(j + n));
      else if (arr[i][j] == '<')
        g[findp(j + n)].push_back(findp(i));
    }
  }
  if (checkloop()) return cout << "NO\n", 0;
  memset(vis, 0, sizeof(vis));
  for (int i = 1; i <= n + m; i++) dfs(findp(i));
  cout << "YES\n";
  for (int i = 1; i <= n + m; i++) {
    cout << ans[findp(i)] << " ";
    if (i == n) cout << "\n";
  }
  cout << "\n";
  return 0;
}
