#include #include #include #include using namespace std; using ll = long long; using ull = unsigned long long; #define rep(i,n) for(int i=0; i<(n); i++) struct Edge2{ int u,v; char c; }; struct Edge{ int to; char c; int i; }; struct PathInfo{ string s; vector e; PathInfo& operator+=(const PathInfo& r){ s += r.s; for(auto i : r.e) e.push_back(i); return *this; } }; int N,M; vector> E; vector J; PathInfo getPath(int s,int t){ vector I = {s}; vector P(N,-1); vector Pi(N,-1); vector F(N,0); F[s] = 1; rep(i,I.size()){ int p = I[i]; for(auto e : E[p]){ int to = J[e].u ^ J[e].v ^ p; if(F[to] != 0) continue; F[to] = 1; I.push_back(to); Pi[to] = e; P[to] = p; } } string ans; vector ansi; while(t != s){ ans.push_back(J[Pi[t]].c); ansi.push_back(Pi[t]); t = P[t]; } reverse(ans.begin(),ans.end()); reverse(ansi.begin(),ansi.end()); return { move(ans),move(ansi) }; } bool iskaibun(const string& s){ rep(i,s.size()) if(s[i] != s[s.size()-1-i]) return false; return true; } int main(){ cin >> N >> M; E.resize(N); rep(i,M){ int u,v; char c; cin >> u >> v >> c; u--; v--; E[u].push_back(i); E[v].push_back(i); J.push_back({u,v,c}); } int firstE = E[N-1][0]; int needE = -1; rep(i,M) if(J[i].c != J[firstE].c) needE = i; if(needE == -1){ cout << "-1\n"; return 0; } auto ans1 = getPath(0,J[needE].u); ans1 += PathInfo{string(1,J[needE].c),{needE}}; ans1 += getPath(J[needE].v,N-1); auto ans2 = getPath(0,J[needE].v); ans2 += PathInfo{string(1,J[needE].c),{needE}}; ans2 += getPath(J[needE].u,N-1); if(ans1.s.size() > ans2.s.size()) swap(ans1,ans2); if(iskaibun(ans1.s)){ ans1.s += string(2,J[firstE].c); rep(c,2) ans1.e.push_back(firstE); } if(ans1.e.size() > 2*N){ cout << "-1\n"; return 0; } cout << ans1.e.size() << "\n"; for(auto a : ans1.e) cout << (a+1) << "\n"; return 0; } struct ios_do_not_sync{ ios_do_not_sync(){ ios::sync_with_stdio(false); cin.tie(nullptr); } } ios_do_not_sync_instance;