Problem: You have recently fallen through a hole and, after several hours of unconsciousness, have realized you are in an underground city. On one of your regular, daily walks through the unknown, you have encountered two unusually looking skeletons called Sanz and P’pairus, who decided to accompany you and give you some puzzles for seemingly unknown reasons.

One day, Sanz has created a crossword for you. Not any kind of crossword, but a 1D crossword! You are given m words and a string of length n. You are also given an array p, which designates how much each word is worth — the i-th word is worth pi points. Whenever you find one of the m words in the string, you are given the corresponding number of points. Each position in the crossword can be used at most x times. A certain word can be counted at different places, but you cannot count the same appearance of a word multiple times. If a word is a substring of another word, you can count them both (presuming you haven’t used the positions more than x times).

In order to solve the puzzle, you need to tell Sanz what’s the maximum achievable number of points in the crossword. There is no need to cover all postions, just get the maximal score! Crossword and words contain only lowercase English letters.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 500) — the length of the crossword. The second line contains the crossword string. The third line contains a single integer m (1 ≤ m ≤ 100) — the number of given words, and next m lines contain description of words: each line will have a string representing a non-empty word (its length doesn't exceed the length of the crossword) and integer pi (0 ≤ pi ≤ 100). Last line of the input will contain x (1 ≤ x ≤ 100) — maximum number of times a position in crossword can be used.

Output

Output single integer — maximum number of points you can get.

Example

Input

6
abacba
2
aba 6
ba 3
3


Output

12

Note

For example, with the string "abacba", words "aba" (6 points) and "ba" (3 points), and x = 3, you can get at most 12 points - the word "aba" appears once ("abacba"), while "ba" appears two times ("abacba"). Note that for x = 1, you could get at most 9 points, since you wouldn’t be able to count both "aba" and the first appearance of "ba".

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
struct Edge {
  int to, rev, cap, cost, f = 0;
  Edge(int to, int rev, int cap, int cost)
      : to(to), rev(rev), cap(cap), cost(cost) {}
};
const int N = 1000;
vector<Edge> g[N];
int prio[N], pot[N], prevNode[N], prevEdge[N], curFlow[N], fq[N];
bool inq[N] = {};
int nodes, src, dest;
void addEdge(int from, int to, int cap, int cost) {
  g[from].push_back(Edge(to, (int)g[to].size(), cap, cost));
  g[to].push_back(Edge(from, (int)g[from].size() - 1, 0, -cost));
}
void bellmanFord(int *dist) {
  for (int i = 0; i < (int)(nodes); ++i) dist[i] = INF;
  dist[src] = 0;
  fq[0] = src;
  for (int qh = 0, qt = 1; qh != qt; qh = ((qh == nodes - 1) ? 0 : (qh + 1))) {
    int v = fq[qh];
    inq[v] = false;
    for (Edge e : g[v])
      if (e.f < e.cap && dist[e.to] > dist[v] + e.cost) {
        dist[e.to] = dist[v] + e.cost;
        if (!inq[e.to]) {
          inq[e.to] = true;
          fq[qt++] = e.to;
          if (qt == nodes) qt = 0;
        }
      }
  }
}
bool used[N];
pair<int, int> minCostFlow(int maxFlow) {
  bellmanFord(pot);
  int flow = 0;
  int flowCost = 0;
  while (flow < maxFlow) {
    for (int i = 0; i < (int)(nodes); ++i) prio[i] = INF;
    for (int i = 0; i < (int)(N); ++i) used[i] = false;
    prio[src] = 0;
    curFlow[src] = INF;
    while (true) {
      int v = -1;
      for (int i = 0; i < (int)(nodes); ++i)
        if (!used[i] && (v == -1 || prio[i] < prio[v])) {
          v = i;
        }
      if (v == -1 || prio[v] >= INF) break;
      used[v] = true;
      for (int i = 0; i < (int)(g[v].size()); ++i) {
        Edge &e = g[v][i];
        if (e.f >= e.cap) continue;
        int newPrio = prio[v] + pot[v] - pot[e.to] + e.cost;
        if (prio[e.to] > newPrio) {
          prio[e.to] = newPrio;
          prevNode[e.to] = v;
          prevEdge[e.to] = i;
          curFlow[e.to] = min(curFlow[v], e.cap - e.f);
        }
      }
    }
    if (prio[dest] >= INF) break;
    for (int i = 0; i < (int)(nodes); ++i)
      if (prio[i] < INF) {
        pot[i] += prio[i];
      }
    int df = min(maxFlow - flow, curFlow[dest]);
    flow += df;
    flowCost += df * pot[dest];
    for (int v = dest; v != src; v = prevNode[v]) {
      Edge &e = g[prevNode[v]][prevEdge[v]];
      e.f += df;
      g[v][e.rev].f -= df;
    }
  }
  return make_pair(flow, flowCost);
}
int n, m;
char buf[1234];
string s;
string w[100];
int p[100];
int main() {
  scanf("%d%s", &n, buf);
  s = string(buf);
  scanf("%d", &m);
  for (int i = 0; i < (int)(m); ++i) {
    scanf("%s%d", buf, p + i);
    w[i] = string(buf);
  }
  int x;
  scanf("%d", &x);
  dest = n;
  src = dest + 1;
  nodes = src + 1;
  addEdge(src, 0, x, 0);
  for (int i = 0; i < (int)(n); ++i) {
    for (int j = 0; j < (int)(m); ++j) {
      int ni = i + (int)w[j].length();
      if (ni > n) continue;
      if (s.substr(i, w[j].length()) != w[j]) continue;
      addEdge(i, ni, 1, -p[j]);
    }
    addEdge(i, i + 1, 1234, 0);
  }
  printf("%d\n", -minCostFlow(1234).second);
  return 0;
}