import
java.util.*;
class
GFG {
static
void
print_in_order(
int
a1[],
int
a2[],
int
n,
int
m)
{
HashMap<Integer, Integer> mp =
new
HashMap<>();
for
(
int
i =
0
; i < n; i++)
mp.put(a1[i],mp.getOrDefault(a1[i],
0
)+
1
);
for
(
int
i =
0
; i < m; i++) {
if
(mp.containsKey(a2[i])) {
for
(
int
j =
0
; j < mp.get(a2[i]); j++)
System.out.print(a2[i] +
" "
);
mp.remove(a2[i]);
}
}
for
(
int
i:mp.keySet()) {
for
(
int
j =
0
; j < mp.get(i); j++)
System.out.print(i +
" "
);
}
System.out.println();
}
public
static
void
main (String[] args) {
int
a1[] = {
2
,
1
,
2
,
5
,
7
,
1
,
9
,
3
,
6
,
8
,
8
};
int
a2[] = {
2
,
1
,
8
,
3
};
int
n = a1.length;
int
m = a2.length;
print_in_order(a1, a2, n, m);
}
}