##### Canadian Computing Competition: 2000 Stage 2, Day 1, Problem 1

In this problem, you will write a program to find the minimal solution to a set of set inequalities. A set inequality has the format `X contains S`

where may be any set name and may be a set name or set element. If is a set name the inequality means that is a superset or equal to . If is an element the inequality means that contains . Sets are named - and contain elements from -.

The first line of input specifies the number of set inequalities (). The next lines each contain one set inequality. For each set name that appears in the input, your program must determine its minimal set: the smallest set of elements that the name must take in order that all of the inequalities hold. Output, in alphabetical order, each set name followed its minimal set, with the elements in alphabetical order, in the format shown below.

#### Sample Input

```
9
A contains B
A contains c
B contains d
F contains A
F contains z
X contains Y
Y contains X
X contains x
Q contains R
```

#### Sample Output

```
A = {c,d}
B = {d}
F = {c,d,z}
Q = {}
R = {}
X = {x}
Y = {x}
```

## Comments

What is the maximum of in this question?

edit: The maximum of ended up being irrelevant in my solution anyway :p

Is it guaranteed the sets won't be cyclic? i.e; if A contains B can B contain A

No. They can be cyclic.

Is there only 1 element per set? etc: A = {c, d, d}?.

NVM. There's only 1 element per set.

Will the set element always be char's?

Yeah it should be. That's what it said in the instructions.