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

The problem statement has recently been changed. View the changes.

×
F. Speed Dial

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputPolycarp's phone book contains $$$n$$$ phone numbers, each of them is described by $$$s_i$$$ — the number itself and $$$m_i$$$ — the number of times Polycarp dials it in daily.

Polycarp has just bought a brand new phone with an amazing speed dial feature! More precisely, $$$k$$$ buttons on it can have a number assigned to it (not necessary from the phone book). To enter some number Polycarp can press one of these $$$k$$$ buttons and then finish the number using usual digit buttons (entering a number with only digit buttons is also possible).

Speed dial button can only be used when no digits are entered. No button can have its number reassigned.

What is the minimal total number of digit number presses Polycarp can achieve after he assigns numbers to speed dial buttons and enters each of the numbers from his phone book the given number of times in an optimal way?

Input

The first line contains two integers $$$n$$$ and $$$k$$$ ($$$1 \le n \le 500$$$, $$$1 \le k \le 10$$$) — the amount of numbers in Polycarp's phone book and the number of speed dial buttons his new phone has.

The $$$i$$$-th of the next $$$n$$$ lines contain a string $$$s_i$$$ and an integer $$$m_i$$$ $$$(1 \le m_i \le 500)$$$, where $$$s_i$$$ is a non-empty string of digits from $$$0$$$ to $$$9$$$ inclusive (the $$$i$$$-th number), and $$$m_i$$$ is the amount of times it will be dialed, respectively.

It is guaranteed that the total length of all phone numbers will not exceed $$$500$$$.

Output

Print a single integer — the minimal total number of digit number presses Polycarp can achieve after he assigns numbers to speed dial buttons and enters each of the numbers from his phone book the given number of times in an optimal way.

Examples

Input

3 1 0001 5 001 4 01 1

Output

14

Input

3 1 0001 5 001 6 01 1

Output

18

Note

The only speed dial button in the first example should have "0001" on it. The total number of digit button presses will be $$$0 \cdot 5$$$ for the first number + $$$3 \cdot 4$$$ for the second + $$$2 \cdot 1$$$ for the third. $$$14$$$ in total.

The only speed dial button in the second example should have "00" on it. The total number of digit button presses will be $$$2 \cdot 5$$$ for the first number + $$$1 \cdot 6$$$ for the second + $$$2 \cdot 1$$$ for the third. $$$18$$$ in total.

Codeforces (c) Copyright 2010-2022 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/04/2022 03:41:38 (j3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|