#include<stdio.h>
#include<time.h>
#include<stdlib.h>
#include<vector>
using namespace std;
#define nmax 102
#define mmax 1002
#define tmax 50000000
#define f first
#define s second
int n,m,sol[nmax];
pair<int,int> v[mmax];

inline int abs(int a){return a<0?-a:a;}

inline bool cond(int i)
{
	int x=sol[abs(v[i].f)],y=sol[abs(v[i].s)];
	if(v[i].f<0)
		x^=1;
	if(v[i].s<0)
		y^=1;
	return x|y;
}

int main()
{
	srand(time(0));
	freopen("party.in","r",stdin);
	freopen("party.out","w",stdout);
	scanf("%d%d",&n,&m);
	int i,j,a,b,c;
	for(i=1;i<=m;i++)
	{
		scanf("%d%d%d",&a,&b,&c);
		if(c==2)
			b=-b;
		if(c==3)
			a=-a;
		if(c==4)
		{
			a=-a;
			b=-b;
		}
		v[i]=make_pair(a,b);
	}
	for(i=1;i<=n;i++)
		sol[i]=rand()%2;
	
	int lim=tmax/m;
	if(20*n<lim)
		lim=20*n;
	for(i=1;i<=lim;i++)
	{
		for(j=1;j<=m;j++)
		{
			if(cond(j)==0)
			{
				if(rand()&1)
					sol[abs(v[j].f)]^=1;
				else
					sol[abs(v[j].s)]^=1;
				break;
			}
		}
		if(j==m+1)
		{
			int nr=0;
			for(j=1;j<=n;j++)
				nr+=sol[j];
			printf("%d\n",nr);
			for(j=1;j<=n;j++)
				if(sol[j])
					printf("%d\n",j);
			return 0;
		}
	}
	return 0;
}