#include <bits/stdc++.h>

using namespace std;
#define int long long
const int maxn=5e5+5;
vector<pair<int,int> > a[maxn];bool used[maxn];int col[maxn];
void dfs(int x)
{
    used[x]=true;
    for(auto [v,w]:a[x])
    {
        if(used[v])
        {
            if((col[v]^col[x])!=w) {puts("No");exit(0);}
        }
        else
        {
            col[v]=col[x]^w;
            dfs(v);
        }
    }
}
int32_t main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int n,m;cin>>n>>m;
    for(int i=0;i<m;++i)
    {
        int x;cin>>x;string s;cin>>s;int y;cin>>y;--x;--y;
        if(s==("<==>")) {a[x].push_back({y,0});a[y].push_back({x,0});}
        else {a[x].push_back({y,1});a[y].push_back({x,1});}
    }
    for(int i=0;i<40;++i){
            for(int i=0;i<n;++i) {col[i]=rand()%2;used[i]=false;}
    for(int i=0;i<n;++i) if(!used[i]) dfs(i);
    int s=accumulate(col,col+n,0LL);
    if(2*s==n) continue;
    if(2*s>=n){cout<<"Yes"<<'\n';cout<<s<<'\n';for(int i=0;i<n;++i) {if(col[i]) cout<<i+1<<' ';}}
    else {cout<<"Yes"<<'\n';cout<<n-s<<'\n';for(int i=0;i<n;++i) {if(!col[i]) cout<<i+1<<' ';}}
    return 0;
    }
    cout<<"No"<<'\n';
    return 0;
}