#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m) {
if (n == 0 && m == 0)
break;
map<int, int> mp;
int num;
while (n--) {
cin >> num;
mp[num] = 1;
}
while (m--) {
cin >> num;
if (mp[num] == 1)
mp[num] = 0;
}
vector<int> ans;
for (auto m : mp)
if (m.second == 1)
ans.push_back(m.first);
if (ans.size() == 0) {
cout << "NULL" << endl;
continue;
} else {
cout << ans[0];
for (int i = 1; i < ans.size(); i++) {
cout << " " << ans[i];
}
cout << endl;
}
}
return 0;
}