codeforces #541 D. Gourmet choice(拓扑+并查集)

Mr. Apple, a gourmet, works as editor-in-chief of a gastronomic periodical. He travels around the world, tasting new delights of famous chefs from the most fashionable restaurants. Mr. Apple has his own signature method of review  — in each restaurant Mr. Apple orders two sets of dishes on two different days. All the dishes are different, because Mr. Apple doesn't like to eat the same food. For each pair of dishes from different days he remembers exactly which was better, or that they were of the same quality. After this the gourmet evaluates each dish with a positive integer.

Once, during a revision of a restaurant of Celtic medieval cuisine named «Poisson», that serves chestnut soup with fir, warm soda bread, spicy lemon pie and other folk food, Mr. Apple was very pleasantly surprised the gourmet with its variety of menu, and hence ordered too much. Now he's confused about evaluating dishes.

The gourmet tasted a set of nn dishes on the first day and a set of mm dishes on the second day. He made a table aa of size n×mn×m, in which he described his impressions. If, according to the expert, dish ii from the first set was better than dish jj from the second set, then aijaij is equal to ">", in the opposite case aijaij is equal to "<". Dishes also may be equally good, in this case aijaij is "=".

Now Mr. Apple wants you to help him to evaluate every dish. Since Mr. Apple is very strict, he will evaluate the dishes so that the maximal number used is as small as possible. But Mr. Apple also is very fair, so he never evaluates the dishes so that it goes against his feelings. In other words, if aijaij is "<", then the number assigned to dish ii from the first set should be less than the number of dish jj from the second set, if aijaij is ">", then it should be greater, and finally if aijaij is "=", then the numbers should be the same.

Help Mr. Apple to evaluate each dish from both sets so that it is consistent with his feelings, or determine that this is impossible.

Input

The first line contains integers nn and mm (1≤n,m≤10001≤n,m≤1000) — the number of dishes in both days.

Each of the next nn lines contains a string of mm symbols. The jj-th symbol on ii-th line is aijaij. All strings consist only of "<", ">" and "=".

Output

The first line of output should contain "Yes", if it's possible to do a correct evaluation for all the dishes, or "No" otherwise.

If case an answer exist, on the second line print nn integers — evaluations of dishes from the first set, and on the third line print mmintegers — evaluations of dishes from the second set.

Examples

input

3 4
>>>>
>>>>
>>>>

output

Yes
2 2 2
1 1 1 1

input

3 3
>>>
<<<
>>>

output

Yes
3 1 3
2 2 2

input

3 2
==
=<
==

output

No

 

题意：

第一天有n个菜，第二天有m个菜。

给一个n*m矩阵，含有（或=、<），a（i，j）指的是：第一天的第i件菜的美味度>（或=、<）第二天的第j件菜的美味度。求出满足这个矩阵的n+m件菜的各自的美味度，要求使用的最大数字尽量小。

思路：如果是等号就用并查集连在一起(缩点) 其他的就拓扑排序

#include <cstdio>
#include <map>
#include <iostream>
#include<cstring>
#include<bits/stdc++.h>
#define ll long long int
#define M 6
using namespace std;
inline ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
inline ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int moth[]={,,,,,,,,,,,,};
int dir[][]={, ,, ,-, ,,-};
int dirs[][]={, ,, ,-, ,,-, -,- ,-, ,,- ,,};
const int inf=0x3f3f3f3f;
const ll mod=1e9+;
int n,m;
int f[];
char G[][];
vector<int> v[];
int ru[];
int ans[];
bool flag;
int find(int x){
    if(x!=f[x])
        f[x]=find(f[x]);
    return f[x];
}
void join(int x,int y){
    int xx=find(x); int yy=find(y);
    if(xx!=yy){
        f[yy]=xx;
    }
}
void toposort(){
    queue<pair<int,int> > q;
    for(int i=;i<=n+m;i++)
        if(!ru[i]&&i==find(i)) q.push(make_pair(i,));
    while(!q.empty()){
        int x=q.front().first;
        int y=q.front().second;
        q.pop();
        ans[x]=y;
        int len=v[x].size();
        for(int i=;i<len;i++){
            int to=find(v[x][i]);
            ru[to]--;
            if(!ru[to]){
                q.push(make_pair(to,y+));
            }
        }
    }
}
int main(){
    ios::sync_with_stdio(false);
    cin>>n>>m;
    for(int i=;i<=n+m;i++) f[i]=i;
    flag=;
    for(int i=;i<=n;i++)
        for(int j=;j<=m;j++){
            cin>>G[i][j];
            if(G[i][j]=='=')  //合并
                join(i,j+n);
        }
    for(int i=;i<=n;i++)
        for(int j=;j<=m;j++){
            if(G[i][j]=='=') continue;
            int xx=find(i); int yy=find(n+j);
            if(xx==yy){
                flag=;
                break;
            }
            if(G[i][j]=='>') v[yy].push_back(xx),ru[xx]++; //计算入度
            if(G[i][j]=='<') v[xx].push_back(yy),ru[yy]++;
            if(!flag) break;
        }

        if(!flag) cout<<"No"<<endl;
        else{
            toposort();
            for(int i=;i<=n+m;i++)
            if(ans[find(i)]==){
                flag=;
                break;
            }
            if(!flag) cout<<"No"<<endl;
            else{
                cout<<"Yes"<<endl;
                for(int i=;i<=n;i++)
                    cout<<ans[find(i)]<<" ";
                cout<<endl;
                for(int i=;i<=m;i++)
                    cout<<ans[find(n+i)]<<" ";
                cout<<endl;
            }
        }
    return ;
}