You are given a list of paths, where each path connects two cities. Find the destination city, which is the city that has a path coming in but no path going out.

Determine if it is possible to finish all courses given prerequisite relationships between them. Essentially, detect if a cycle exists in the course dependencies.

You're given a list of restaurants with their vegan-friendly status, price, and distance. Select the restaurants that match specified vegan, price, and distance criteria and return their IDs in sorted order.