import sys
sys.setrecursionlimit(5*10**5)
input = sys.stdin.readline
from collections import defaultdict, deque, Counter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right
from math import gcd
from collections import defaultdict
n,m = map(int,input().split())
graph = [[] for i in range(n+1)]
for i in range(m):
    u, e, v = map(str,input().split())
    u = int(u)
    v = int(v)
    if e == "<=/=>":
        graph[u].append((v,1))
        graph[v].append((u,1))
    else:
        graph[u].append((v,0))
        graph[v].append((u,0))

def bfs(s, n):
    que = deque([s])
    depth = [-1]*(n+1)
    depth[s] = 0
    ok = 1
    while que:
        crr = que.popleft()
        for nxt,w in graph[crr]:
            if depth[nxt] == -1:
                depth[nxt] = depth[crr]^w
                que.append(nxt)
            else:
                if depth[nxt] != depth[crr]^w:
                    ok = 0

    return ok, depth
ok, d = bfs(1, n)
if not ok:
    print('No')
else:
    z = []
    o = []
    no = []
    for i in range(1, n+1):
        if d[i] == 1:
            o.append(i)
        elif d[i] == 0:
            z.append(i)
        else:
            no.append(i)
    print('Yes')
    if len(o) > len(z):
        o += no
        o.sort()
        print(len(o))
        print(*o)
    else:
        z+= no
        z.sort()
        print(len(z))
        print(*z)