import java.util.*;
public class Main {
public int[] solution(int[] a,int aLength,int[] b,int bLength) {
Integer[] a1=new Integer[aLength];
Integer[] b1=new Integer[bLength];
for(int i=0;i<aLength;i++){
a1[i]=new Integer(a[i]);
}
for(int i=0;i<bLength;i++){
b1[i]=new Integer(b[i]);
}
Set<Integer> intersectionSet = new HashSet<Integer>();
intersectionSet.addAll(Arrays.asList(a1));
intersectionSet.retainAll(Arrays.asList(b1));
ArrayList<Integer> tempList = new ArrayList<>();
for (Integer integer : intersectionSet) {
tempList.add(integer);
}
Collections.sort(tempList);
int k = tempList.size();
int[] result = new int[k];
for (int i = 0; i < k; i++) {
result[i] = tempList.get(i);
}
return result;
}
}