A Binary Search Tree (BST) is a binary tree where every node has a value and the tree is arranged so that, for any node all the values in its left subtree are less than the node's value, and all the values in its right subtree are greater than the node's value.

To build a BST from a sequence of distinct integers the following procedure is used. The first integer becomes the root of the tree. Then the second integer in the sequence is considered. If it is less than the value of the root node then it becomes the left child. Otherwise, it becomes the right child. Subsequent items in the sequence move down either left or right in the same fashion depending on the comparison against earlier nodes, starting at the root and progressing down the tree. The new node is inserted (as a leaf) into the partially constructed tree when it reaches a missing subtree in the particular direction of travel.

The same BST can often be generated by various sequences. For example, the same BST is generated from (1) 2, 1, 4, 3, (2) 2, 4, 3, 1 and (3) 2, 4, 1, 3.

Such sequences can be compared according to a lexicographic
order, where the comparison proceeds left-to-right and items
at corresponding positions are compared using their numerical
values. The result is shown below, using **<** to denote this
lexicographic order between sequences:

2, 1, 4, 3 < 2, 4, 1, 3 < 2, 4, 3, 1.

Write a program that will read a representation of a tree and will generate the lexicographically least sequence of distinct positive integers that will generate that tree. Note that for a tree with n nodes this sequence will be a permutation of the numbers from 1 to n.

For the input to our problem we represent (recursively) the structure of a tree as follows:

A single node (a leaf) is a tree: ()

If TL and TR are trees then the following are also trees:

(TL,) (,TR) (TL,TR)

Input will consist of a sequence of lines. Each line will consist of up to 250 characters and will contain the specification of a single tree according to the above definition (with no intervening spaces). The sequence will be terminated by a tree consisting of a single node `()'. This line should not be processed.

Output will be a sequence of lines, one for each line in the input. Each line will consist of the required permutation of the integers from 1 to n (where n is the number of nodes in the tree) separated by single spaces.

((),((),)) (((),),()) (((),()),((),())) (,()) ((),) ()

2 1 4 3 3 2 1 4 4 2 1 3 6 5 7 1 2 2 1