import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;


public class CF_177F {

	int[][] marriages;
	int n;
	ArrayList<Integer> list;
	
	public static void main(String[] args) {
		new CF_177F().solve();
	}
		
	private void solve() {
		Scanner in = new Scanner(System.in);
		n = in.nextInt();
		int m = in.nextInt(), t = in.nextInt();
		marriages = new int[n][n];
		list = new ArrayList<Integer>();
		
		for(int i = 0; i < m; i++) {
			marriages[in.nextInt() - 1][in.nextInt() - 1] = in.nextInt();
		}
		
		list.add(0);
		search(0, 0, 0);
		
		Collections.sort(list);
		System.out.println(list.get(t - 1));

	}
	
	private void search(int idx, int mask, int delight) {
		if(idx == n) return;
		
		for(int i = 0; i < n; i++) {
			if(marriages[idx][i] > 0 && (((mask >> i) & 1) == 0)) {
				list.add(delight + marriages[idx][i]);
				search(idx + 1, mask | (1 << i), delight + marriages[idx][i]);
			}
		}
		
		search(idx + 1, mask, delight);
	}

}
