#include <bits/stdc++.h>

#define ll long long
#define ld  double
using namespace std;

const int N = 5e5 + 5, mod = 998244353;


vector<pair<int, pair<int, int> > > adj[N];



int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);


    int n, m, k;
    cin >> n >> m >> k;
    map<pair<int, int>, int>  mp;
    for(int i = 0; i < m; i++) {
        int u, v, t, sz;
        cin >> u >> v >> t >> sz;

        for(int j = 0; j < sz; j++) {
            int col;
            cin >> col;
            mp[{u, col}]++;
            adj[v].push_back({col, {u, t}});
        }
    }
    const ll inf = 1e18;
    vector<ll> dis(n + 1, inf);
    vector<ll> tmp(n + 1, 0);
    dis[n] = 0;

    priority_queue<pair<ll, int> > pq;
    pq.push({0, n});
    while((int) pq.size() > 0) {
        ll cost = -pq.top().first;
        int node = pq.top().second;
        pq.pop();
        if(dis[node] != cost) continue;
        for(auto i: adj[node]) {
            int col = i.first, child = i.second.first, w = i.second.second;
            mp[{child, col}]--;
            tmp[child] = max(tmp[child], dis[node] + w);

            if(mp[{child, col}] == 0 && dis[child] > tmp[child]) {
                dis[child] = tmp[child];
                pq.push({-dis[child], child});
            }
        }
    }

    if(dis[1] == inf) cout << "impossible";
    else cout << dis[1];

    return 0;
}