You are given an array, routes, representing bus routes where routes[i] is a bus route that the $i^{th}$ bus repeats forever. Every route contains one or more stations. You have also been given the source station, src, and a destination station, dest. Return the minimum number of buses someone must take to travel from src to dest, or return -1 if there is no route.

Constraints:

• $1 \le$ routes.length $\le 50$
• $1 \le$ routes[i].length $\le 100$
• $0 \le$ routes[i][j] $< 1000$
• $0 \le$ src, dest $< 1000$