AT_abc415_b [ABC415B] Pick Two

There is a linear warehouse, which stores an **even number** of packages. The layout of the warehouse is represented by a string $ S $ . The warehouse has $ |S| $ sections, numbered $ 1,2,\dots,|S| $ , and the string $ S $ describes them as follows: - When the $ i $ -th character of $ S $ is `#`, one package is placed in section $ i $ . - When the $ i $ -th character of $ S $ is `.`, no package is placed in section $ i $ . The warehouse has a robot, which repeats the following action until there are no more packages in the warehouse: - Collect two packages from the sections with the smallest section numbers among the sections containing packages. The collected packages are carried out of the warehouse. For each iteration, determine which sections of the warehouse the two packages that were carried out were originally located.

The input is given from Standard Input in the following format: > $ S $

Let $ m $ be the total number of packages stored in the warehouse. Output $ m/2 $ lines. The $ i $ -th line should contain the section numbers where the packages carried out in the $ i $ -th iteration were originally located, in ascending order, **separated by a comma**.

### Sample Explanation 1 Packages are stored in sections $ 2,4,5,8,9,11,13,14,15,20 $ . - In the $ 1 $ st iteration, packages from sections $ 2,4 $ are carried out. - In the $ 2 $ nd iteration, packages from sections $ 5,8 $ are carried out. - In the $ 3 $ rd iteration, packages from sections $ 9,11 $ are carried out. - In the $ 4 $ th iteration, packages from sections $ 13,14 $ are carried out. - In the $ 5 $ th iteration, packages from sections $ 15,20 $ are carried out. ### Constraints - $ S $ is a string consisting of `#` and `.` with length between $ 2 $ and $ 1000 $ , inclusive. - The warehouse stores an even number of packages. - The warehouse stores at least two packages.