eolymp
bolt
Try our new interface for solving problems
Problems

Kaucuk

Kaucuk

Davor the scientist writes his papers in LATEX. Inspired by LATEX, he came up with Kaučuk. Kaučuk is a very simple program for preparing a piece of text for print. It allows you to number the headings of sections, subsections and subsubsections and prepare them for print. Kaučuk has only three different commands: \begin{itemize} \item The \textbf{section} command starts a new section. All sections from the input are numbered in the output with positive integers starting from $1$, in the order they appear in the input (see first example). \item The \textbf{subsection} command starts a new subsection. Subsections are numbered using two numbers: the number of the section which contains the subsection, and the number of the subsection within the section (see second example). In each section the subsection numbering starts again from $1$ (see third example). \item The \textbf{subsubsection} command starts a new subsubsection which uses three numbers: the number of the section, the number of the subsection and the number of the subsubsection within the subsection, in a manner similar to subsections within sections (see second example). \end{itemize} It is guaranteed that in the input, each subsection is contained in some section, and each subsubsection is contained in some subsection. Davor might be a fine scientist, but programming is not his strong suit, which is why he is asking you to help him write a program which prepares a text written in Kaučuk for print. \InputFile The first line contains a positive integer $n\:(1 \le n \le 100)$, the number of lines of Kaučuk commands. The following $n$ lines contain Davor’s Kaučuk code. Each line of code is made up from two strings of characters, separated by a single space: the type of section (section, subsection or subsubsection) and its title. Each title is made up from at most $20$ lowercase letters. \OutputFile In $n$ lines you should number and print the titles of the sections, subsections and subsubsections from Davor’s code.
Time limit 1 second
Memory limit 128 MiB
Input example #1
3
section zivotinje
section boje
section voce
Output example #1
1 zivotinje
2 boje
3 voce
Input example #2
4
section zivotinje
subsection macke
subsection psi
subsubsection mops
Output example #2
1 zivotinje
1.1 macke
1.2 psi
1.2.1 mops
Input example #3
4
section zivotinje
subsection psi
section voce
subsection ananas
Output example #3
1 zivotinje
1.1 psi
2 voce
2.1 ananas
Source 2021 COCI Croatian Open Competition In Informatics, Round 2, November 13