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.

They are students.aeiouSample Output:
Thy r stdnts.
#include <cstdio>#include <cstdlib>#include <iostream>#include <deque>#include <queue>#include <cstring>#include <vector>#include <string>#include <iomanip>#include <cmath>#include <algorithm>using namespace std;#define max1 10001#define inf 6000int main(){    string a,b;    int g[1000],i;    getline(cin,a);    getline(cin,b);    for(i=0;i<b.length();i++)        g[b[i]]=1;    for(i=0;i<a.length();i++)    {        if(g[a[i]]!=1)            cout<<a[i];    }    return 0;}