Cow Routing II

Bessie the cow is tired of the cold winter weather on her farm and plans to fly somewhere warmer for vacation. Only one airline, Air Bovinia, sells tickets to cows, and its tickets have an unusual structure.

Air Bovinia operates $N$ planes. Each plane flies one route that visits several cities in a fixed order. For example, one plane might fly a route that starts at city 1, then goes to city 5, then to city 2, and finally to city 8. No city appears twice in the same route.

If Bessie uses a route, she may board at any city on that route and disembark at any city that comes later on the same route. She does not have to board at the first city or disembark at the last city. Each route has a fare, and using any part of the route costs the full fare no matter how many cities she passes. Bessie may use a route only once, so she cannot use one route and later use a different segment of that same route.

Bessie wants the cheapest way to travel from city $A$, where her farm is, to city $B$, her destination. She does not want a complicated itinerary, so she uses at most two routes. Find the minimum fare she must pay.

The first line contains $A$, $B$, and $N$, separated by spaces. ($1 \le A \le 10000$, $1 \le B \le 10000$, $1 \le N \le 500$)

The next $2N$ lines describe the routes, two lines per route. The first line of a route contains the fare for that route and the number of cities on it. The fare is an integer between $1$ and $1000$, and the number of cities is an integer between $1$ and $500$. The second line lists the cities on the route in flight order, each given as an integer between $1$ and $10000$.

Print, on one line, the minimum fare to travel from city $A$ to city $B$ using at most two routes. If no such itinerary exists, print $-1$. If $A$ equals $B$, print $0$.