A small letterpress shop keeps a single case of metal type: a fixed multiset of lowercase letter blocks that never gets restocked mid-shift. Customers drop off order slips, each a lowercase word they want typeset. A slip can be fulfilled only if the case currently holds at least as many blocks of every letter as that slip needs — for example, a slip containing two 'e's needs the case to contain at least two 'e' blocks. Slips are checked independently against the original, unchanging case (fulfilling one slip never consumes blocks that another slip also needs). Given the case's letters and the day's order slips, find the combined length of every slip that can be fully typeset.

Input format

• Line 1: a string chars — the letters currently sitting in the type case (lowercase English letters only).
• Line 2: an integer n — the number of order slips.
• Next n lines: one lowercase word each, the text of a single order slip.

Output format

Print a single integer: the sum of the lengths of every slip that can be typeset entirely from chars.

Constraints

• 1 <= length of chars <= 100
• 1 <= n <= 1000
• 1 <= length of each slip word <= 100
• All strings consist only of lowercase English letters ('a'-'z').

printery
3
print
tinier
entry

10

a
2
a
aa

1