#include <iostream>
#include <fstream>
#include <vector>
#include <map>
#include <set>
using namespace std;

int main()
{
  ifstream cin("almost.in");
  for (int n,m,k;cin>>n>>m>>k,!(n==0&&m==0&&k==0);){
    static bool fst=true;
    if (fst) fst=false;
    else cout<<endl;
    
    vector<vector<pair<int,int> > > g(n),h(n);
    vector<pair<pair<int,int>,int> > edge(m);
    for (int i=0;i<m;i++){
      int f,t,c;cin>>f>>t>>c;
      f--,t--;
      g[f].push_back(make_pair(c,t));
      h[t].push_back(make_pair(c,f));
      edge[i]=make_pair(make_pair(f,t),c);
    }

    int st=0,ed=n-1;
    vector<int> cost1(g.size(),-1);
    vector<int> cost2(g.size(),-1);
    {
      multimap<int,int> mm;
      mm.insert(make_pair(0,st));
      while(!mm.empty()){
        int c=mm.begin()->first;
        int ix=mm.begin()->second;
        mm.erase(mm.begin());
        if (cost1[ix]>=0) continue;
        cost1[ix]=c;
        for (int i=0;i<g[ix].size();i++){
          int nc=c+g[ix][i].first;
          int nx=g[ix][i].second;
          if (cost1[nx]>=0) continue;
          mm.insert(make_pair(nc,nx));
        }
      }
    }
    {
      multimap<int,int> mm;
      mm.insert(make_pair(0,ed));
      while(!mm.empty()){
        int c=mm.begin()->first;
        int ix=mm.begin()->second;
        mm.erase(mm.begin());
        if (cost2[ix]>=0) continue;
        cost2[ix]=c;
        for (int i=0;i<h[ix].size();i++){
          int nc=c+h[ix][i].first;
          int nx=h[ix][i].second;
          if (cost2[nx]>=0) continue;
          mm.insert(make_pair(nc,nx));
        }
      }
    }
    int sc=cost1[ed];

    set<int> ans;
    for (int i=0;i<m;i++){
      int f=edge[i].first.first,t=edge[i].first.second;
      int c=edge[i].second;
      if (!(cost1[f]<0||cost2[t]<0)){
        int ec=cost1[f]+c+cost2[t];
        if (ec<=sc+k) ans.insert(i);
      }
    }
    cout<<ans.size()<<endl;
    for (set<int>::iterator p=ans.begin();
         p!=ans.end();p++){
      cout<<(*p)+1<<endl;
    }
  }
  return 0;
}