#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T gcd(T a, T b) {
  return (b) == 0 ? (a) : gcd((b), ((a) % (b)));
}
template <class T>
inline T lcm(T a, T b) {
  return ((a) / gcd((a), (b)) * (b));
}
template <class T>
inline T BigMod(T Base, T power, T M = 1000000007) {
  if (power == 0) return 1;
  if (power & 1)
    return ((Base % M) * (BigMod(Base, power - 1, M) % M)) % M;
  else {
    T y = BigMod(Base, power / 2, M) % M;
    return (y * y) % M;
  }
}
template <class T>
inline T ModInv(T A, T M = 1000000007) {
  return BigMod(A, M - 2, M);
}
int fx[] = {-1, +0, +1, +0, +1, +1, -1, -1, +0};
int fy[] = {+0, -1, +0, +1, +1, -1, +1, -1, +0};
int day[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int n, m;
string s[2000];
vector<int> v[200005];
int vis[200005];
int black[200005], mata[200005], grey[200005], visited[200005];
stack<int> st;
int val[200005], ck[200005], visit[200005];
vector<int> par[200005];
bool dfs(int s) {
  bool x = false;
  if (grey[s]) return true;
  if (black[s]) return false;
  grey[s] = 1;
  vis[s] = 1;
  for (auto it : v[s]) {
    x = x | dfs(it);
  }
  grey[s] = 0;
  black[s] = 1;
  return x;
}
void dfs2(int s) {
  if (visited[s]) return;
  visited[s] = 1;
  for (auto it : v[s]) {
    dfs2(it);
  }
  st.push(s);
}
int findMata(int s) {
  if (mata[s] == s)
    return s;
  else
    return mata[s] = findMata(mata[s]);
}
bool cycle() {
  bool x;
  for (int i = 0; i < n + m; i++) {
    if (vis[findMata(i)] == 0) {
      x = dfs(findMata(i));
      if (x) return true;
    }
  }
  return false;
}
void dfs3(int s, int value) {
  if (visit[s]) return;
  visit[s] = 1;
  val[s] = value;
  for (auto it : v[s]) dfs3(it, value + 1);
}
bool WA() {
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (s[i][j] == '=' && val[i] != val[n + j] ||
          s[i][j] == '<' && val[i] >= val[n + j] ||
          s[i][j] == '>' && val[n + j] >= val[i]) {
        return true;
      }
    }
  }
  return false;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m;
  for (int i = 0; i < n; i++) cin >> s[i];
  for (int i = 0; i < n + m; i++) mata[i] = i;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (s[i][j] == '=') {
        int x = findMata(i);
        int y = findMata(n + j);
        mata[x] = mata[y];
      }
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      int x = findMata(i);
      int y = findMata(n + j);
      if (s[i][j] == '<')
        v[x].push_back(y), par[y].push_back(x);
      else if (s[i][j] == '>')
        v[y].push_back(x), par[x].push_back(y);
    }
  }
  bool x = cycle();
  if (x)
    cout << "No";
  else {
    int cnt = 1;
    memset(ck, -1, sizeof(ck));
    for (int i = 0; i < n + m; i++)
      if (visited[findMata(i)] == 0) dfs2(findMata(i));
    while (!st.empty()) {
      int x = st.top();
      st.pop();
      val[x] = 1;
      for (auto it : par[x]) val[x] = max(val[x], val[it] + 1);
    }
    for (int i = 0; i < n + m; i++) val[i] = val[findMata(i)];
    if (WA()) {
      cout << "No" << endl;
    } else {
      cout << "Yes" << endl;
      for (int i = 0; i < n; i++) cout << val[findMata(i)] << " ";
      cout << endl;
      for (int i = n; i < n + m; i++) cout << val[findMata(i)] << " ";
    }
  }
  return 0;
}
