1.　　编写并测试如下函数：

void Add (int a[], int m, int b[], int n)

该函数将数组b的前n个元素追加到数组a的前m个元素后，假定数组a具有至少存放m+n个元素的空间。例如，如果数组a为{22,33,44,55,66,77,88,99}，数组b为{20,30,40,50,60,70,80,90}，则调用Add(a,5,b,3)后，将把数组a变为{22,33,44,55,66,20,30,40}。注意数组b并没有改变，而且数组a中只需改变n个元素。

输入：4行。第一行为两个整数：m，n，并以空格隔开，分别表示将要输入的数组a和数组b的元素的个数。第二行为m个整数，为数组a的元素；第三行为n个整数，为数组b的元素。第四行为两个整数m1，n1，表示把数组b的前n1个元素追加到数组a的前m1个元素后。



输出：1行。第一行为最后数组a中的元素，两个元素之间以逗号隔开。最后一个元素输出后，输出一个空行。

-1. Write and test the following function: void Add (int a [], int m, int b [], int n)　after the function will first n elements of the array b is appended to the front of the array a m elements, assuming Array A has a store at least m+n element space. For example, if the array is {a} 22,33,44,55,66,77,88,99 array b} for {20,30,40,50,60,70,80,90, call the Add (a , 5, b, 3), the array will become a} {22,33,44,55,66,20,30,40. Note that the array b has not changed, but the array simply a change in n elements. Inputs: 4 lines. The first acts of two integers: m, n, and separated by a space, respectively, the number will be entered arrays a and b of the array elements. The second behavior integers m, the elements of the array a　third acts integer n, b array elements. Fourth behavior of two integers m1, n1, n1 represents the front element of the array b is appended to the front element of the array a m1. Output: 1 line. The first acts of the last element in the array a, between the two elemen