Problem: 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 n dishes on the first day and a set of m dishes on the second day. He made a table a of size n × m, in which he described his impressions. If, according to the expert, dish i from the first set was better than dish j from the second set, then a_{ij} is equal to ">", in the opposite case a_{ij} is equal to "<". Dishes also may be equally good, in this case a_{ij} 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 a_{ij} is "<", then the number assigned to dish i from the first set should be less than the number of dish j from the second set, if a_{ij} is ">", then it should be greater, and finally if a_{ij} 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 n and m (1 ≤ n, m ≤ 1000) — the number of dishes in both days.

Each of the next n lines contains a string of m symbols. The j-th symbol on i-th line is a_{ij}. 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 n integers — evaluations of dishes from the first set, and on the third line print m integers — evaluations of dishes from the second set.

Examples

Input


3 4
&gt;&gt;&gt;&gt;
&gt;&gt;&gt;&gt;
&gt;&gt;&gt;&gt;


Output


Yes
2 2 2 
1 1 1 1 


Input


3 3
&gt;&gt;&gt;
&lt;&lt;&lt;
&gt;&gt;&gt;


Output


Yes
3 1 3 
2 2 2 


Input


3 2
==
=&lt;
==


Output


No

Note

In the first sample, all dishes of the first day are better than dishes of the second day. So, the highest score will be 2, for all dishes of the first day.

In the third sample, the table is contradictory — there is no possible evaluation of the dishes that satisfies it.

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;

public class D541 {
    static Map<Integer, ArrayList<Integer>> adj = new HashMap<>();
    static int [] rank;
    static int [] vis;
    static boolean ok;
    static ArrayList<Integer> top;
    public static void main(String[] args) {
        MyScanner sc = new MyScanner();
        PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
        int n = sc.nextInt(); int m = sc.nextInt();
        int [][] a = new int[n][m];
        UF dsu = new UF(n + m); int z = 0;
        for (int i = 0; i < n; i++) {
            String s = sc.next();
            for (int j = 0; j < m; j++) {
                if (s.charAt(j) == '>') a[i][j] = 1;
                else if (s.charAt(j) == '<') a[i][j] = -1;
                else {
                    dsu.union(i, j + n);
                    ++z;
                }
            }
        }
        if (z == n * m) {
            out.println("Yes");
            for (int i = 0; i < n; i++) out.print(1 + " ");
            out.println();
            for (int i = 0; i < m; i++) out.print(1 + " ");
            out.close();
            return;
        }
        adj = new HashMap<>();
        ok = true;
        int [] in = new int[n + m + 1];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (a[i][j] == -1) {
                    int par = dsu.find(j + n);
                    if (!adj.containsKey(par)) adj.put(par, new ArrayList<>());
                    int next = dsu.find(i);
                    adj.get(par).add(next);
                    in[next]++;
                    if (!adj.containsKey(next)) adj.put(next, new ArrayList<>());
                } else if (a[i][j] == 1) {
                    int par = dsu.find(i);
                    if (!adj.containsKey(par)) adj.put(par, new ArrayList<>());
                    int next = dsu.find(j + n);
                    adj.get(par).add(next);
                    in[next]++;
                    if (!adj.containsKey(next)) adj.put(next, new ArrayList<>());
                }
            }
        }
        rank = new int[n + m];
        top = new ArrayList<>();
        Arrays.fill(rank, 1);
        vis = new int[n + m];
        if (adj.size() == 1) {
            out.println("No");
            out.close();
            return;
        }
        for (int i = 0; i < n + m; i++) {
            if (!adj.containsKey(i)) continue;
            if (vis[i] == 0) dfs(i);
        }
        if (!ok) {
            out.println("No");
            out.close();
            return;
        }
        for (Integer node: top) {
            int r = 1;
            for (Integer next: adj.getOrDefault(node, new ArrayList<>())) {
                r = Math.max(rank[next] + 1, r);
            }
            rank[node] = r;
        }
        out.println("Yes");
        for (int i = 0; i < n; i++) {
            out.print(rank[dsu.find(i)] + " ");
        }
        out.println();
        for (int j = 0; j < m; j++) {
            out.print(rank[dsu.find(j + n)] + " ");
        }
        out.close();
    }

    static void dfs(int cur) {
        vis[cur] = 1;
        for (Integer next: adj.getOrDefault(cur, new ArrayList<>())) {
            if (vis[next] == 0) {
                dfs(next);
            } else if (vis[next] == 1) {
                ok = false;
                return;
            }
        }
        top.add(cur);
        vis[cur] = 2;
    }

    static class UF {
        private int[] parent;  // parent[i] = parent of i
        private byte[] rank;   // rank[i] = rank of subtree rooted at i (never more than 31)
        private int count;     // number of components
        private int[] size;
        public UF(int n) {
            if (n < 0) throw new IllegalArgumentException();
            count = n;
            parent = new int[n];
            rank = new byte[n];
            size = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
                rank[i] = 0;
                size[i] = 1;
            }
        }

        public int find(int p) {
            while (p != parent[p]) {
                parent[p] = parent[parent[p]];    // path compression by halving
                p = parent[p];
            }
            return p;
        }

        public int count() {
            return count;
        }

        public boolean connected(int p, int q) {
            return find(p) == find(q);
        }

        public void union(int p, int q) {
            int rootP = find(p);
            int rootQ = find(q);
            if (rootP == rootQ) return;

            // make root of smaller rank point to root of larger rank
            if (rank[rootP] < rank[rootQ]) {
                parent[rootP] = rootQ;
                size[rootQ] = size[rootQ] + size[rootP];
            }
            else if (rank[rootP] > rank[rootQ]) {
                parent[rootQ] = rootP;
                size[rootP] = size[rootP] + size[rootQ];
            }
            else {
                parent[rootQ] = rootP;
                size[rootP] = size[rootP] + size[rootQ];
                rank[rootP]++;
            }
            count--;
        }
    }


    //-----------MyScanner class for faster input----------
    public static class MyScanner {
        BufferedReader br;
        StringTokenizer st;

        public MyScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }


    }

}