Given An array of Alphabets and their frequency. Your task is to print all the given alphabets Huffman Encoding.

**Note: **If two elements have same frequency, then the element which if at first will be taken on left of Binary Tree and other one to right.

**Input:**

First line consists of test cases T. First line of every test case consists of string of alphabets and second line consists of its frequencies.

**Output:**

Print the HuffmanCodes in single line, with n spaces of each alphabet's HuffmanCodes respectively. In PreOrder form of Binary Tree.

**Constraints:**

1<=T<=100

1<=|String length|<=26

**Example:
Input:**

1

abcdef

5 9 12 13 16 45

0 100 101 1100 1101 111

**Explanation:**

For the above test case.

HuffmanCodes will be

f: 0

c: 100

d: 101

a: 1100

b: 1101

e: 111

Print in the PreOrder of Binary Tree.

Author: saksham seth

Rajat Thakur 2 | 255 |

P_K | 244 |

vegascrew | 231 |

surbhi_7 | 230 |

ByteWalker | 226 |

white walker | 710 |

BST | 679 |

stevecooper | 625 |

MahaBharat | 610 |

chacha_vidhayak_hai_hmare | 595 |

akhayrutdinov | 4634 |

Ibrahim Nash | 3664 |

sanjay05 | 3633 |

Quandray | 3343 |

surbhi_7 | 2634 |