输入



输入偏序集 <A, > ， A 中的元素数不超过 20 个，分别用单个小写的英文字母表示。



输入的第一行给出 A 中的各个元素，两个相邻的元素之间用逗号隔开。



输入的第二行给出偏序关系 ，用有序对的形式给出，如 <a,b>,<c,a> 等等，两个相邻的有序对之间用逗号隔开。



输出



输出 A 的极小元与极大元。



输出的第一行给出各个极小元，两个相邻元素之间用逗号隔开，输出的元素要求按照英文字母的自然顺序排列输出。



输出的第二行给出各个极大元，两个相邻元素之间用逗号隔开，输出的元素要求按照英文字母的自然顺序排列输出。-Enter input poset <A,　> The number of elements in A is not more than 20, respectively, with a single lowercase letters of the alphabet. The first line of input gives the individual elements in the A, between two adjacent elements separated by commas. The second line of the input given partial order, ordered pair form given <a,b> And <c,a> Between two adjacent ordered pair separated by commas. Output Output A minimizer maximal element. The first line of output is given each minimal element between two adjacent elements, separated by commas, output element requirements in accordance with the natural order of the letters of the alphabet are arranged output. The second line of output given the various maximal element between two adjacent elements separated by a comma, the output element requirements in accordance with the natural order of the letters of the alphabet are arranged output.