Three Arrays

You are given three arrays $A$, $B$, and $C$, all of length $N$. You also have two integers $k_1$ and $k_2$. For every index $1 \leq i \leq N$, you must choose **exactly one** of $A_i, B_i$, or $C_i$. Find the **maximum** possible sum of chosen elements, such that: - At most $k_1$ elements are picked from $A$, and - At most $k_2$ elements are picked from $B$ ### Input - The first line of input c