Contest 1 — B: Oasis Shares

**Description:** n travelers share m liters of water. The i-th traveler (in order) takes water greedily: as many full liters as remain, but at most c[i]. Print how many liters each traveler actually takes; leftovers at the end go unclaimed. **Input:** Line 1: n m (1 <= n <= 200000, 0 <= m <= 10^9). Line 2: n integers (1 <= c[i] <= 10^9). **Output:** One line: n numbers, space-separated — liters taken by each traveler. **Example:** 3 10 / 4 5 2 -> 4 5 1.