Given two strings S₁ and S₂, S = S₁ - S₂ is defined to be the remaining string after taking all the characters in S₂ from S₁. Your task is simply to calculate S₁ - S₂ for any given strings. However, it might not be that simple to do it fast.

Input Specification:

Each input file contains one test case. Each case consists of two lines which gives S₁ and S₂, respectively. The string lengths of both strings are no more than 10⁴. It is guaranteed that all the characters are visible ASCII codes and white space, and a new line character signals the end of a string.

Output Specification:

For each test case, print S₁ - S₂ in one line.

Sample Input:

They are students.

aeiou

Sample Output:

Thy r stdnts.

#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <string.h>
#include <algorithm>
using namespace std;
string s1,s2;
bool mycompare(char ch)
{
string::iterator it;
for(it= s2.begin();it!=s2.end();it++)
{
if(ch == *it)
return true;
}
return false;
}
int main()
{

getline(cin,s1);
getline(cin,s2);
sort(s2.begin(),s2.end());
s2.erase(unique(s2.begin(),s2.end()),s2.end());
s1.resize(remove_if(s1.begin(),s1.end(),mycompare)-s1.begin());
cout<< s1<<endl;

return 0;
}