#C14605. Text Summarization Simulation

    ID: 44273 Type: Default 1000ms 256MiB

Text Summarization Simulation

Text Summarization Simulation

In this problem, you are given a set of texts, and your task is to produce a summarized version of each text according to a predefined set of rules.

Specifically, if the input text exactly matches one of the following:

  • \(\texttt{The quick brown fox jumps over the lazy dog.}\) should be summarized as \(\texttt{The quick fox jumps over a lazy dog.}\)
  • \(\texttt{In the beginning, the universe was created.}\) should be summarized as \(\texttt{The universe was created in the beginning.}\)

For any other input text, output Summary not available.

You need to read the input from standard input and output the summaries to standard output.

inputFormat

The first line of the input contains an integer \(T\) denoting the number of texts. Each of the next \(T\) lines contains a single text to be summarized.

outputFormat

For each text, output its summary on a new line. The summary is determined by the rules described above.

## sample
2
The quick brown fox jumps over the lazy dog.
In the beginning, the universe was created.
The quick fox jumps over a lazy dog.

The universe was created in the beginning.

</p>