include<bits/stdc++.h>

using namespace std; const int N = 1e6 + 1; long long a[N], b[N]; vector <int> ans; int main() { int n, m; cin >> n >> m; for(int i = 0; i < n; i++) cin >> a[i]; for(int i = 0; i < m; i++) cin >> b[i]; sort(a, a + n); sort(b, b + m); int i = 0, j = 0; while(i < n && j < m) { if(a[i] == b[j]) { if(ans.empty() || a[i] != ans.back()) ans.push_back(a[i]); i++; j++; } else if(a[i] > b[j]) j++; else i++; } if(ans.empty() == true) cout << "EMPTY"; else for(int k : ans) cout << k << " ";