Array Merge

Background

Congcong has recently been learning about array operations and encountered an interesting small challenge. He needs to construct a new short array from two given arrays according to specific rules.

Problem Description

Given two integer arrays, $a$ and $b$, return a new array of length $2$. The new array should contain, as much as will fit, the elements from $a$ followed by the elements from $b$. The arrays may be of any length, including $0$, but it is guaranteed that there will be $2$ or more elements available between the two arrays.

Input Format

Input is given from standard input in the following format.

A single line containing two integer arrays, $a$ and $b$. Elements within each array are space-separated and enclosed in square brackets []. The two arrays are separated by a single space.

Output Format

Output is printed to standard output in the following format.

A single line containing an integer array of length $2$. Elements within the array are separated by a comma and a space , , and enclosed in square brackets [].

Sample

[4 5] [1 2 3]

[4, 5]

[4] [1 2 3]

[4, 1]

[] [1 2]

[1, 2]

Sample Explanation

Sample 1: Array $a$ contains $2$ elements [4, 5], which is enough to fill the result array. Thus, the result is [4, 5].

Sample 2: Array $a$ contains $1$ element [4]. We take all elements from $a$, then take the first element [1] from array $b$ to fill the remaining position. Thus, the result is [4, 1].

Sample 3: Array $a$ is empty. We take the first $2$ elements [1, 2] from array $b$ to fill the result array. Thus, the result is [1, 2].

Constraints

Time limit: $1$ second, Memory limit: $1024$ KiB.