Elevator Dispatch System

You are tasked with developing a simulation for an elevator dispatch system in a high-rise building.

The building has N floors (numbered 1 through N) and M elevators. Each elevator takes 1 unit of time to travel between adjacent floors.

Throughout the day, the system receives elevator requests. Each request is represented as a tuple: (time, start_floor, destination_floor), where:

• time is the timestamp when the request was made.
• start_floor is the floor where the passenger is waiting.
• destination_floor is the floor where the passenger wants to go.

Your task is to simulate the dispatch system with the following requirements:

1. Process the list of requests in chronological order.
2. When an elevator is idle, it should be assigned the next request that minimizes the waiting time (taking into account its current position and the travel time to the request's start_floor).
3. Each elevator can handle only one request at a time. If a new request comes in while an elevator is busy, it must wait until the elevator becomes available.
4. In case multiple elevators can fulfill a request in the same amount of time, you may choose any one of them.
5. Produce an output that details the dispatch schedule for each elevator. For each assigned request, indicate the time the elevator starts moving towards the request, and the time it reaches the destination.

Write a program that, given the number of floors, the number of elevators, and a list of requests, simulates the system and returns the complete dispatch schedule for each elevator.