Natural Navigation

문제

You want to build an app to help people navigate through a large botanic garden. This is difficult, because there are many winding footpaths and intersections offering many choices, making traditional directions such as "turn right" or "move further north" unsuitable. Instead, the app should rely on the garden's greatest resource: the numerous exotic plants and their diverse colours. Whenever a user is at an intersection, the app will know where they are and will display one particular colour accordingly. The user will then follow a footpath where this colour is visible. If the colour can be spotted along multiple footpaths originating from the intersection, the user is free to choose any of these footpaths.

You have been given a perfect model of the botanic garden, consisting of $nn$ intersections (numbered from $11$ to $nn$) and $mm$ footpaths going between those. To keep order, each footpath can only be used in the given direction. Currently, the plants are exhibiting $kk$ different colours (numbered from $11$ to $kk$) and for each footpath, you are given a list of all the colours that are visible along it when viewed from the intersection where it starts. A user is currently at intersection $11$ and wants to navigate to intersection $nn$. You can assume that the user will follow the app's directions perfectly, but whenever faced with multiple options (because the given colour is visible along multiple footpaths), you have to assume they will make the worst possible choice. How long will it take to reach the target when your app gives the best possible instructions?

입력

The input consists of:

• A line containing the number of intersections $nn$ ($1\le n\le 5\cdot {10}^{5}1\; \backslash leq\; n\; \backslash leq\; 5\; \backslash cdot\; 10^5$), the number of footpaths $mm$ ($1\le m\le 5\cdot {10}^{5}1\; \backslash leq\; m\; \backslash leq\; 5\; \backslash cdot\; 10^5$) and the number of distinct colours $kk$ ($1\le k\le 10001\; \backslash leq\; k\; \backslash leq\; 1\backslash ,000$).
• $mm$ pairs of lines describing the directed footpaths, each formatted as follows:
  • One line with three integers $uu$, $vv$ and $tt$ ($1\le u,v\le n,1\le t\le {10}^{6}1\; \backslash le\; u,v\; \backslash le\; n,\; 1\; \backslash le\; t\; \backslash le\; 10^6$), meaning that the footpath leads from intersection $uu$ to intersection $vv$ and it takes $tt$ seconds to walk along this footpath.
  • One line with an integer $\mathrm{\ell }\backslash ell$ ($1\le \mathrm{\ell }\le k1\; \backslash leq\; \backslash ell\; \backslash leq\; k$), followed by $\mathrm{\ell }\backslash ell$ distinct integers $c_1,\dots ,c_{\mathrm{\ell }}c\_1,\backslash dots,c\_\backslash ell$ ($1\le c_i\le k1\; \backslash le\; c\_i\; \backslash le\; k$ for each $ii$), listing the colours that appear along this footpath.

The sum of $\mathrm{\ell }\backslash ell$ over all footpaths does not exceed $5\cdot {10}^{5}5\; \backslash cdot\; 10^5$. Note that, as you would imagine in a botanic garden, a footpath can lead back to the intersection it started from and multiple footpaths can exist between a pair of intersections. Moreover, it is not guaranteed that each intersection can be reached via the footpaths.

출력

If it is impossible to lead the user to intersection $nn$, output impossible. Otherwise output a single integer, the time it will take to reach the target in seconds. We are only considering the time spent walking along the footpaths.