#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
signed main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	int n,m,k;
	cin >> n >> m >> k;
	vector<vector<pair<int,pii>>>adj(n+1); // reverse graph
	vector<map<int,int>>hm(n+1);
	vector<vector<int>>edges(m);
	for(int i = 0; i<m; i++){
		int x,y,w;
		cin >> x >> y >> w;
		int l;
		cin >> l;
		adj[y].push_back({w,{i,x}});
		for(int j = 0; j<l; j++){
			int c;
			cin >> c;
			hm[x][c]++;
			edges[i].push_back(c);
		}
	}
	vector<int>dis(n+1,(int)1e18);
	vector<bool>vis(n+1);
	vector<bool>good(n+1);
	priority_queue<pair<int,pii>,vector<pair<int,pii>>,greater<pair<int,pii>>>pq;
	dis[n] = 0;
	vis[0] = true;
	for(auto [w,e]: adj[n]){
		int idx = e.first;
		int nxt = e.second;
		pq.push({w,{idx,nxt}});
	}
	while(pq.size()){
		auto [dist, cur] = pq.top(); pq.pop();
		int idx = cur.first;
		int dest = cur.second;
		if(vis[dest])continue;
		for(int c: edges[idx]){
			hm[dest][c]--;
			if(hm[dest][c] == 0){
				vis[dest] = true;
				dis[dest] = dist;
			}
		}
		if(vis[dest]){
			for(auto [w, e] : adj[dest]){
				pq.push({w + dist, e});
			}
		}
	}
	if(vis[1]){
		cout << dis[1] << '\n';
	}
	else{
		cout << "impossible\n";
	}
	return 0;
}