A cloud edge platform serves traffic from one region that runs k identical compute workers labeled 0 through k - 1. An intake router reads a chronological log of incoming jobs. The i-th job appears at second arrival[i] and, once placed, keeps its worker occupied for load[i] consecutive seconds; the worker rejoins the idle pool at second arrival[i] + load[i] and may accept new work during that very second.

Routing policy is strict and deterministic: when a job appears, the router hands it to the idle worker with the smallest label. If every worker is still occupied at that second, the job is bounced back to the caller and never retried. Note that a worker whose occupancy ends exactly at second t counts as idle for a job that arrives at second t.

After the whole log is processed, operations wants a utilization report. Return the labels of every worker tied for the greatest number of successfully placed jobs, sorted in increasing order.