A warehouse wrist-scanner has its input keys arranged into three physical zones. Each zone covers a fixed set of lowercase letters, no two zones share a letter, and together the three zones cover every letter of the alphabet exactly once. Every crate in the warehouse carries a printed label made only of letters (the label's casing on the printout may mix upper and lower case, but tapping any letter -- of either case -- always presses the same physical key, so case does not affect which zone a letter belongs to). A label can be entered by an operator who is only allowed to tap keys from a single zone if and only if every letter of that label belongs to the same zone. Find every label that can be entered this way.

Input format

• Line 1: three strings z1, z2, z3, separated by single spaces -- the letters assigned to zone 1, zone 2, and zone 3 respectively. The three strings are pairwise disjoint and their combined letters are exactly the 26 lowercase letters, each appearing once.
• Line 2: an integer m, the number of labels.
• Next m lines: one label per line, each a string of 1 to 20 letters (upper case and lower case only).

Output format

Print, one per line, exactly the labels that can be typed using keys from a single zone only -- preserving each label's original casing exactly as given, and in the same relative order as the input. If no label qualifies, print nothing.

Constraints

• z1, z2, z3 are pairwise disjoint, and together contain each of the 26 lowercase letters exactly once
• 1 <= m <= 100
• 1 <= length of each label <= 20, letters only

abcdefghij klmnopqrs tuvwxyz
5
Bead
Sort
Fig
Xyz
Cab

Bead
Fig
Xyz
Cab

abcdefghij klmnopqrs tuvwxyz
4
AbC
TUV
Mop
Fast

AbC
TUV
Mop