xt 1143 K叉赫夫曼树

Data Encoding

Given a string S, your job is to encode it into a new string T using given charset C. To make the decoding easy, each original character X in S is encoded into a string Y made up of characters in C. What's more, for two different X₁ and X₂, Y₁ must be different from Y₂ and all its non-empty prefixes. What's the minimum possible length of T?

Input

There are multiple test cases. Each test case contains two lines, S and C. The length of S will be at most 100000. The length of C will be at least 2 and all characters in C will be different.