You are given an integer array loads, where each element represents the current load on a server. You are also given two integers: k (the number of incoming tasks) and multiplier .

You must perform k operations. In each operation:

Find the server with the lowest load d (the minimum value in loads).

If there are multiple servers with the same lowest load, choose the one that appears first in the array.

Assign the new task to that server by replacing the selected value d with d * multiplier.

After all k tasks have been assigned, return the final state of the loads array.

Example 1:

Input: loads = [4, 1, 7, 3], k = 5, multiplier = 2  
Output: [8, 8, 7, 6]
Explanation:
After operation 1: [4, 2, 7, 3] // 1 → 2 at index 1
After operation 2: [4, 4, 7, 3] // 2 → 4 at index 1
After operation 3: [4, 4, 7, 6] // 3 → 6 at index 3
After operation 4: [8, 4, 7, 6] // 4 → 8 at index 0
After operation 5: [8, 8, 7, 6] // 4 → 8 at index 1

Example 2:

Input: loads = [1, 2], k = 4, multiplier = 3
Output: [9,18]
Explanation:
After operation 1:	[3, 2]
After operation 2:	[3, 6]
After operation 3:	[9, 6]
After operation 4:	[9, 18]

Example 3:

Input: loads = [2, 2, 3], k = 2, multiplier = 2
Output: [4, 4, 3]
Explanation:
After operation 1: [4, 2, 3]  // choose index 0 because it is the first minimum
After operation 2: [4, 4, 3]  // choose index 1

Constraints

1 <= loads.length <= 100

1 <= loads[i] <= 100

1 <= k <= 10

1 <= multiplier <= 5

The final array must maintain the original size (loads.length), only values are modified.

63. Server Load Balancing