#include <bits/stdc++.h>
using namespace std;
void intersection(int *arr1, int *arr2, int n, int m) 
{
    set<int>h1;
    for(int i=0;i<n;i++)
    {
        h1.insert(arr1[i]);

    }
  
    for(int i=0;i<m;i++)
    { if (h1.find(arr2[i]) == h1.end()) 
     {
      continue;
     }
    else cout<<arr2[i]<<" ";
}return;
}