Problem: When Kefa came to the restaurant and sat at a table, the waiter immediately brought him the menu. There were n dishes. Kefa knows that he needs exactly m dishes. But at that, he doesn't want to order the same dish twice to taste as many dishes as possible. 

Kefa knows that the i-th dish gives him ai units of satisfaction. But some dishes do not go well together and some dishes go very well together. Kefa set to himself k rules of eating food of the following type — if he eats dish x exactly before dish y (there should be no other dishes between x and y), then his satisfaction level raises by c. 

Of course, our parrot wants to get some maximal possible satisfaction from going to the restaurant. Help him in this hard task!

Input

The first line of the input contains three space-separated numbers, n, m and k (1 ≤ m ≤ n ≤ 18, 0 ≤ k ≤ n * (n - 1)) — the number of dishes on the menu, the number of portions Kefa needs to eat to get full and the number of eating rules.

The second line contains n space-separated numbers ai, (0 ≤ ai ≤ 109) — the satisfaction he gets from the i-th dish.

Next k lines contain the rules. The i-th rule is described by the three numbers xi, yi and ci (1 ≤ xi, yi ≤ n, 0 ≤ ci ≤ 109). That means that if you eat dish xi right before dish yi, then the Kefa's satisfaction increases by ci. It is guaranteed that there are no such pairs of indexes i and j (1 ≤ i < j ≤ k), that xi = xj and yi = yj.

Output

In the single line of the output print the maximum satisfaction that Kefa can get from going to the restaurant.

Examples

Input

2 2 1
1 1
2 1 1


Output

3


Input

4 3 2
1 2 3 4
2 1 5
3 4 2


Output

12

Note

In the first sample it is best to first eat the second dish, then the first one. Then we get one unit of satisfaction for each dish and plus one more for the rule.

In the second test the fitting sequences of choice are 4 2 1 or 2 1 4. In both cases we get satisfaction 7 for dishes and also, if we fulfill rule 1, we get an additional satisfaction 5.

Solution (in JAVA):

Solution:
// Arup Guha
// 7/15/2021
// Solution to Codeforces contest 580 Problem D: Kefa and Dishes

import java.util.*;

public class kefa {

	public static void main(String[] args) {
		
		// Set up.
		Scanner stdin = new Scanner(System.in);
		int n = stdin.nextInt();
		int allowed = stdin.nextInt();
		long[][] add = new long[n][n];
		int numR = stdin.nextInt();
		
		// Read in goodness pts of dishes.
		long[] cost = new long[n];
		for (int i=0; i<n; i++)
			cost[i] = stdin.nextLong();
			
		// Read in bonus pairs.
		for (int i=0; i<numR; i++) {
			int a = stdin.nextInt()-1;
			int b = stdin.nextInt()-1;
			int val = stdin.nextInt();
			add[a][b] = val;
		}		
		
		// Set up DP with benefit of eating exactly 1 dish.
		long[][] dp = new long[1<<n][n];
		for (int i=0; i<n; i++) 
			dp[1<<i][i] = cost[i];
		
		// i mask
		for (int i=1; i<(1<<n); i++) {
		
			// Skip these.
			if (Integer.bitCount(i) < 2) continue;
			
			// j is the last item eaten.
			for (int j=0; j<n; j++) {
			
				// Not in our mask.
				if ((i & (1<<j)) == 0) continue;
				
				// The subset of items without item j.
				int pM = i - (1<<j);
				
				// prev is the item we ate right before j.
				for (int prev=0; prev<n; prev++) {
				
					// Not in our previous subset.
					if ((pM & (1<<prev)) == 0) continue;
					
					// We gain the points of eating item j plus the bonus combo of (prev,j).
					long curC = dp[pM][prev] + cost[j] + add[prev][j];
					
					// Update.
					dp[i][j] = Math.max(dp[i][j], curC);
				}
			}
		}
		
		// Go through the dp array, looking at the best answer for any subset with the right # of items.
		long res = 0;
		for (int i=0; i<(1<<n); i++) {
			if (Integer.bitCount(i) != allowed) continue;
			for (int j=0; j<n; j++) {
				res = Math.max(res, dp[i][j]);
			}
		}
		System.out.println(res);
	}
}