// UUID: 6cae8eea-fe9a-4127-bb10-fe3486a80034
#include <bits/stdc++.h>
using namespace std;

vector<vector<pair<int,int>>>g;
vector<pair<int,int>>edge;
vector<int>dir;
bool found=false;

void dfs(int x){
	while(!g[x].empty() && !found){
		pair<int,int>y=g[x].back();
		g[x].pop_back();
		if(dir[y.second]==0){
			dir[y.second]=y.first;
			dfs(y.first);
		}
	}
	found=true;
}

int main() {
	int n,m;cin>>n>>m;
	g.resize(n+1);edge.resize(m+1);dir.resize(m+1);
	for(int i=1;i<=m;i++){
		int u,v;cin>>u>>v;
		g[u].push_back({v,i});
		g[v].push_back({u,i});
		edge[i]={u,v};
	}
	int c=0;
	for(int i=1;i<=n;i++)if(g[i].size()%2==1)c++;
	for(int i=1;i<=n;i++){
		if(!g[i].empty()){
			found=false;
			dfs(i);
		}
	}
	for(int i=1;i<=n;i++){
		if(!g[i].empty()){
			found=false;
			dfs(i);
		}
	}
	cout<<c<<'\n';
	for(int i=1;i<=m;i++){
		if(edge[i].second==dir[i])cout<<"-> ";
		else cout<<"<- ";
	}
}