Minimum Cost Traversal

You are given two arrays, A and B, each containing N positive integers, along with two integer switch costs, X and Y.

You must construct a sequence of N choices by traversing from index 0 to N-1. At each index i, you must choose exactly one element, either A[i] or B[i]. The value of the chosen element contributes to a running total cost.

An additional "switching cost" is incurred if your choice of array at index i is different from your choice at index i-1:

Switching from array A to B (choosing A[i-1] then B[i]) costs X.

Switching from array B to A (choosing B[i-1] then A[i]) costs Y.

Staying on the same array (e.g., A[i-1] then A[i]) has no switching cost.

Your goal is to find the minimum possible total cost to traverse from index 0 to N-1. The total cost is the sum of all chosen elements plus the sum of all incurred switching penalties.

Input Format:

The first line contains three space-separated integers: N, X, and Y.

The second line contains N space-separated integers for array A.

The third line contains N space-separated integers for array B.

Output Format:

Print a single integer representing the minimum possible total cost.