시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
2 초 1024 MB 1 1 1 100.000%

문제

Nowadays, bubble tea has been famous around the globe. They have different names – bubbles, pearls, and tapioka. People start thinking to put almost every food together with tapioka. E.g., bubble tea pizza, bubble tea ramen, bubble tea hotpot, bubble tea cake, and so on.

Given the name of a dish, you are going to repeatedly remove all the tapioka part and reveal the true colors of that dish. Notice that the dishes in this problem will consist of exactly three words. Every dish always starts with either the term “bubble tea” or “tapioka”. For example, you may observe a dish named “bubble tea ramen”, but you will never observe a dish named “bubble ramen tea”.

입력

The input file contains exactly one test case. There is only one line in the input file, and it contains a dish name consisting of exactly three words.

출력

If after repeatedly removing all occurrence of “bubble” or “tapioka” (as entire word) but you found nothing left, output “nothing”. Otherwise, output the remaining words separated by blanks in the original order.

제한

  • In this problem, a word is a string of English letters in lowercase.
  • In the input file, all words are seperated by blanks.
  • The length of each word does not exceed 32.

예제 입력 1

bubble tea pizza

예제 출력 1

tea pizza

예제 입력 2

tapioka cake tapiokas

예제 출력 2

cake tapiokas

예제 입력 3

tapioka jasmine tea

예제 출력 3

jasmine tea

예제 입력 4

tapioka bubble tapioka

예제 출력 4

nothing