You are given two integer arrays nums $1$ and nums $2$ of lengths $m$ and $n$ respectively. nums $1$ and nums $2$ represent

the digits of two numbers. You are also given an integer k$.$

Create the maximum number of length $km+n$ from digits of the two numbers. The relative order of the

digits from the same array must be preserved.

Return an array of the $k$ digits representing the answer.

Example $1$:

Input: nums$1=[3,4,6,5],$ nums$2=[9,1,2,5,8,3],k=5$

Output: $9,8,6,5,3$

Example $2$:

Input: nums$1=[6,7],$ nums$2=[6,0,4],k=5$

Output: $6,7,6,0,4$

Example $3$:

Input: nums$1=[3,9],$ nums$2=[8,9],k=3$

Output: $9,8,9$A die simulator generates a random number from $1$ to $6$ for each roll. You introduced a constraint to the

generator such that it cannot roll the number i more than rollMax$[$i$](1-$indexed$)$ consecutive times.

Given an array of integers and an integer $n,$ return the number of distinct sequences that can be obtained

with exact $n$ rolls. Since the answer may be too large, return it modulo ${10}^9+7.$

Two sequences are considered different if at least one element differs from each other.

Example $1$:

Example $2$:

Example $3$:

Constraints: