#include <bits/stdc++.h>

#define el '\n'
#define ll long long
#define ld long double

#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

const ll INF = 1e18;
const int N = 5e5 + 5;

struct Edge {
    int v;
    int c;
    vector<int> colors;
};

int n;
ll dp[N];
int vis[N];
vector<Edge> g[N];

ll dfs(int u) {
    if (u == n)
        return 0;

    if (vis[u] == 2)
        return INF;

    if (vis[u] == 1)
        return dp[u];

    vis[u] = 2;

    map<int, ll> mxColor;

    for (auto v: g[u]) {
        for (auto col: v.colors)
            mxColor[col] = max(mxColor[col], dfs(v.v) + v.c);
    }

    dp[u] = INF;

    for (auto i: mxColor)
        dp[u] = min(dp[u], i.second);

    vis[u] = 1;

    return dp[u];
}

void testCase() {
    int m, k;
    cin >> n >> m >> k;

    int u, v, t, s;
    while (m--) {
        cin >> u >> v >> t >> s;

        vector<int> colors(s);
        for (auto &i: colors)
            cin >> i;

        g[u].push_back({v, t, colors});
    }

    auto sol = dfs(1);

    if (sol == INF)
        cout << "impossible";
    else
        cout << sol;
}

signed main() {
    Beevo

    int T = 1;
//    cin >> T;

    while (T--)
        testCase();

    return 0;
}