#include <bits/stdc++.h>
using namespace std;
struct path{
    int to,cost;
    vector <int> v;
};
vector <path> v[500005];
map <int,multiset<long long,greater<long long>>> s[500005];
long long dis[500005];
int vis[500005];
int main(){
    int T = 1;
//    cin >> T;
    while(T--) {
        int n,m,k;
        cin>>n>>m>>k;
        for(int i=1,x,y,w,l;i<=m;i++){
            scanf("%d%d%d%d",&x,&y,&w,&l);
            vector <int> temp;
            for(int j=1,c;j<=l;j++) scanf("%d",&c),temp.push_back(c),s[x][c].insert(LLONG_MAX/10);
            v[y].push_back(path{x,w,temp});
        }
        for(int i=1;i<=n;i++) dis[i]=LLONG_MAX/10;
        dis[n]=0;
        priority_queue <pair<long long,int>,vector<pair<long long,int>>,greater<pair<long long,int>>> q;
        q.push({0,n});
        while(!q.empty()){
            auto temp=q.top();
            q.pop();
            long long d=temp.first;
            int x=temp.second;
            if(vis[x]) continue;
            vis[x]=1;
            for(auto t:v[x]){
                for(auto c:t.v){
                    assert(s[t.to][c].find(LLONG_MAX/10)!=s[t.to][c].end());
                    s[t.to][c].erase(s[t.to][c].find(LLONG_MAX/10));
                    s[t.to][c].insert(d+t.cost);
//                    cout<<x<<" "<<t.to<<" "<<d+t.cost<<endl;
                    if(*s[t.to][c].begin()<dis[t.to])
                        dis[t.to]=*s[t.to][c].begin(),q.push({dis[t.to],t.to});
                }
            }
        }
        if(dis[1]==LLONG_MAX/10) puts("impossible");
        else printf("%lld\n",dis[1]);
    }
}