Given two integer arrays preorder and inorder where preorder is the preorder traversal of a binary tree and inorder is the inorder traversal of the same tree, construct and return the binary tree.

Example 1:

Input:
3 9 20 15 7
9 3 15 20 7
Output: 3 9 20 null null 15 7

Example 2:

Input:
-1
-1
Output: -1

Constraints:

• 1 ≤ preorder.length ≤ 3000
• inorder.length == preorder.length
• -3000 ≤ preorder[i], inorder[i] ≤ 3000
• All values in preorder and inorder are unique

Input format: First line: preorder. Second line: inorder.

Output format: BFS level-order of the built tree.