#描述#
Given a string composed of simply lowercase letters, you are asked to erase all its vowels (a, e, i, o, u). That’s truly a breeze to you!

#格式#
##输入格式##
The first line of input contains a number T (1&ltT&lt50), which is the number of test cases. Each of the following T lines contains one string formed by merely lowercase ASCII letters, and its length won’t exceed 100.

##输出格式##
For each test case, print a line the modified string corresponding to the original string. It’s guaranteed that the modified string won’t be an empty string.

#样例1#
##样例输入1##

2
vaio
hakunamatata

##样例输出1##

v
hknmtt

#限制#
1000ms
32768KB

#提示#

#来源#
Limitfan