#include <algorithm>

#include  <iterator>

#include  <iostream>

#include   <cstring>

#include   <cstdlib>

#include   <iomanip>

#include    <bitset>

#include    <cctype>

#include    <cstdio>

#include    <string>

#include    <vector>

#include     <stack>

#include     <cmath>

#include     <queue>

#include      <list>

#include       <map>

#include       <set>

#include   <cassert>

/*

⊂_ヽ

　 ＼＼ Λ＿Λ  来了老弟

　　 ＼('ㅅ')

　　　 >　⌒ヽ

　　　/ 　 へ＼

　　 /　　/　＼＼

　　 ﾚ　ノ　　 ヽ_つ

　　/　/

　 /　/|

　(　(ヽ

　|　|、＼

　| 丿 ＼ ⌒)

　| |　　) /

'ノ )　　Lﾉ

*/

using namespace std;

#define lson (l , mid , rt << 1)

#define rson (mid + 1 , r , rt << 1 | 1)

#define debug(x) cerr << #x << " = " << x << "\n";

#define pb push_back

#define pq priority_queue

typedef long long ll;

typedef long double ld;

typedef unsigned long long ull;

//typedef __int128 bll;

typedef pair<ll ,ll > pll;

typedef pair<int ,int > pii;

typedef pair<int,pii> p3;

//priority_queue<int> q;//这是一个大根堆q

//priority_queue<int,vector<int>,greater<int> >q;//这是一个小根堆q

#define fi first

#define se second

//#define endl '\n'

#define boost ios::sync_with_stdio(false);cin.tie(0)

#define rep(a, b, c) for(int a = (b); a <= (c); ++ a)

#define max3(a,b,c) max(max(a,b), c);

#define min3(a,b,c) min(min(a,b), c);

const ll oo = 1ll<<;

const ll mos = 0x7FFFFFFF;  //

const ll nmos = 0x80000000;  //-2147483648

const int inf = 0x3f3f3f3f;

const ll inff = 0x3f3f3f3f3f3f3f3f; //

const int mod = 1e8;

const double esp = 1e-;

const double PI=acos(-1.0);

const double PHI=0.61803399;    //黄金分割点

const double tPHI=0.38196601;

template<typename T>

inline T read(T&x){

    x=;int f=;char ch=getchar();

    while (ch<''||ch>'') f|=(ch=='-'),ch=getchar();

    while (ch>=''&&ch<='') x=x*+ch-'',ch=getchar();

    return x=f?-x:x;

}

inline void cmax(int &x,int y){if(x<y)x=y;}

inline void cmax(ll &x,ll y){if(x<y)x=y;}

inline void cmin(int &x,int y){if(x>y)x=y;}

inline void cmin(ll &x,ll y){if(x>y)x=y;}

/*-----------------------showtime----------------------*/

            const int maxn = 1e3+;

            char mp[maxn][maxn];

            int fa[maxn*];

            int find(int x){

                if(fa[x] == x) return x;

                return fa[x] = find(fa[x]);

            }

            void uni(int x,int y){

                int fx = find(x);

                int fy = find(y);

                if(fx == fy) return ;

                fa[fx] = fy;

            }

            int ans[maxn*],tmp[maxn*];

            int du[maxn*],vis[maxn*];

            vector<int>G[maxn*];

int main(){

            int n,m;

            scanf("%d%d", &n, &m);

            rep(i, , n) scanf("%s", mp[i] + );

            rep(i, , n+m) fa[i] = i;

            rep(i, , n) {

                rep(j, , m) {

                    if(mp[i][j] == '=') uni(i, j+n);

                }

            }

            rep(i, , n) {

                rep(j, , m) {

                    if(mp[i][j] == '=') continue;

                    int u = find(i), v = find(j+n);

                    if(mp[i][j] == '>'){

                        du[u]++;

                        G[v].pb(u);

                    }

                    else {

                        du[v]++;

                        G[u].pb(v);

                    }

                }

            }

            queue<pii>que;

            for(int i=; i<=n+m; i++){

                if(du[find(i)] ==  && vis[find(i)] == )

                {

                    que.push(pii(find(i),)),vis[find(i)] = ,tmp[find(i)] = ;

                }

            }

            while(!que.empty()){

                int u = que.front().fi;int s = que.front().se; que.pop();

                for(int i=; i<G[u].size(); i++){

                    int v = G[u][i];

                    du[v] --;

                    if(du[v] == && vis[v] == ) {

                        tmp[v] = s+;

                        que.push(pii(v, s+));

                        vis[v] = ;

                    }

                }

            }

            int flag = ;

            for(int i=; i<=n+m; i++) if(vis[find(i)] == ) flag = ;

            if(flag == ) puts("No");

            else {

                puts("Yes");

                for(int i=; i<=n; i++) printf("%d ", tmp[find(i)]);

                puts("");

                for(int i=; i<=m; i++) printf("%d ", tmp[find(i+n)]);

                puts("");

            }

            return ;

}