Parcel Delivery

There are n cities and m routes through which parcels can be carried from one city to another city. For each route, you know the maximum number of parcels and the cost of a single parcel. You want to send k parcels from Syrjälä to Lehmälä. What is the cheapest way to do that? Input The first input line has three integers n, m and k: the number of cities, routes and parcels. The cities are numbe