Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

E. Build String

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou desperately need to build some string *t*. For that you've got *n* more strings *s*_{1}, *s*_{2}, ..., *s*_{n}. To build string *t*, you are allowed to perform exactly |*t*| (|*t*| is the length of string *t*) operations on these strings. Each operation looks like that:

- choose any non-empty string from strings
*s*_{1},*s*_{2}, ...,*s*_{n}; - choose an arbitrary character from the chosen string and write it on a piece of paper;
- remove the chosen character from the chosen string.

Note that after you perform the described operation, the total number of characters in strings *s*_{1}, *s*_{2}, ..., *s*_{n} decreases by 1. We are assumed to build string *t*, if the characters, written on the piece of paper, in the order of performed operations form string *t*.

There are other limitations, though. For each string *s*_{i} you know number *a*_{i} — the maximum number of characters you are allowed to delete from string *s*_{i}. You also know that each operation that results in deleting a character from string *s*_{i}, costs *i* rubles. That is, an operation on string *s*_{1} is the cheapest (it costs 1 ruble), and the operation on string *s*_{n} is the most expensive one (it costs *n* rubles).

Your task is to count the minimum amount of money (in rubles) you will need to build string *t* by the given rules. Consider the cost of building string *t* to be the sum of prices of the operations you use.

Input

The first line of the input contains string *t* — the string that you need to build.

The second line contains a single integer *n* (1 ≤ *n* ≤ 100) — the number of strings to which you are allowed to apply the described operation. Each of the next *n* lines contains a string and an integer. The *i*-th line contains space-separated string *s*_{i} and integer *a*_{i} (0 ≤ *a*_{i} ≤ 100). Number *a*_{i} represents the maximum number of characters that can be deleted from string *s*_{i}.

All strings in the input only consist of lowercase English letters. All strings are non-empty. The lengths of all strings do not exceed 100 characters.

Output

Print a single number — the minimum money (in rubles) you need in order to build string *t*. If there is no solution, print -1.

Examples

Input

bbaze

3

bzb 2

aeb 3

ba 10

Output

8

Input

abacaba

4

aba 2

bcc 1

caa 2

bbb 5

Output

18

Input

xyz

4

axx 8

za 1

efg 4

t 1

Output

-1

Note

Notes to the samples:

In the first sample from the first string you should take characters "b" and "z" with price 1 ruble, from the second string characters "a", "e" и "b" with price 2 rubles. The price of the string *t* in this case is 2·1 + 3·2 = 8.

In the second sample from the first string you should take two characters "a" with price 1 ruble, from the second string character "c" with price 2 rubles, from the third string two characters "a" with price 3 rubles, from the fourth string two characters "b" with price 4 rubles. The price of the string *t* in this case is 2·1 + 1·2 + 2·3 + 2·4 = 18.

In the third sample the solution doesn't exist because there is no character "y" in given strings.

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/12/2019 10:22:15 (g1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|