#include <bits/stdc++.h>
#pragma GCC optimize(3, "Ofast", "inline")
using namespace std;
long long qpow(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) res = res * a;
    a = a * a;
    b >>= 1;
  }
  return res;
}
long long qpow(long long a, long long b, long long mod) {
  long long res = 1;
  while (b) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return res;
}
long long inv(long long a, long long mod) { return qpow(a, mod - 2, mod); }
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
template <typename T>
inline void read(T &x) {
  x = 0;
  T f = 1;
  char c = getchar();
  for (; !isdigit(c); c = getchar())
    if (c == '-') f = -1;
  for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
  x *= f;
}
template <typename T>
inline void write(T x) {
  if (x < 0) {
    putchar('-');
    x = -x;
  }
  if (x > 9) write(x / 10);
  putchar(x % 10 + '0');
}
const double eps = 1e-10;
const long long inf = 0x3f3f3f3f, base = 137, mod = 1e9 + 7;
const int N = 1e3 + 5, M = N * N + 5, S = 1e6 + 5;
char c;
vector<pair<int, int> > vc[N << 1];
int d[N << 1];
int v[N << 1];
bool flag;
int n, m;
int cnt[N << 1];
bool spfa(int st) {
  queue<int> q;
  memset(d, -1, sizeof d);
  memset(v, 0, sizeof v);
  d[st] = 0;
  v[st] = 1;
  cnt[st] = 1;
  q.push(st);
  while (q.size()) {
    int x = q.front();
    q.pop();
    v[x] = 0;
    for (int i = 0; i < vc[x].size(); i++) {
      int y = vc[x][i].first, z = vc[x][i].second;
      if (d[y] < d[x] + z) {
        d[y] = d[x] + z;
        if (!v[y]) {
          cnt[y]++;
          if (cnt[y] >= n + m + 1) return false;
          v[y] = 1;
          q.push(y);
        }
      }
    }
  }
  return true;
}
void solve() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) {
    getchar();
    for (int j = 1; j <= m; j++) {
      scanf("%c", &c);
      if (c == '>') {
        vc[j + n].push_back({i, 1});
      } else if (c == '<') {
        vc[i].push_back({j + n, 1});
      } else {
        vc[j + n].push_back({i, 0});
        vc[i].push_back({j + n, 0});
      }
    }
  }
  for (int i = 1; i <= n + m; i++) vc[0].push_back({i, 1});
  flag = spfa(0);
  if (flag) {
    for (int i = 1; i <= n + m; i++) {
      if (d[i] == -1) {
        flag = 0;
        break;
      }
    }
  }
  if (flag) {
    printf("Yes\n");
    for (int i = 1; i <= n; i++) printf("%d ", d[i]);
    printf("\n");
    for (int i = n + 1; i <= n + m; i++) printf("%d ", d[i]);
  } else
    printf("No\n");
}
int main() {
  int T = 1;
  while (T--) {
    solve();
  }
}
