#include <stdio.h>
#include <algorithm>

using namespace std;

#define MAX_N 310
#define MAX_E 50010

int n, m, k, nr, cost;
int L[MAX_N], R[MAX_N], ind[MAX_E], use[MAX_E];
struct muchie {
	int x, y, val;
} v[MAX_E];

inline int cmp(int x, int y) {
	return v[x].val < v[y].val;
}

int main() {

	freopen("cmcm.in", "r", stdin);
	freopen("cmcm.out", "w", stdout);

	scanf("%d %d %d", &n, &m, &k);
	for (int i = 1; i <= k; i++) {
		scanf("%d %d %d", &v[i].x, &v[i].y, &v[i].val);
    	ind[i] = i;
	}

	sort(ind + 1, ind + k + 1, cmp);

	for (int i = 1; i <= k; i++)
		if (!L[v[ind[i]].x] && !R[v[ind[i]].y]) {
        	L[v[ind[i]].x] = R[v[ind[i]].y] = 1;
			use[ind[i]] = 1;
			nr++;
			cost += v[ind[i]].val;
		}

	printf("%d %d\n", nr, cost);
	for (int i = 1; i <= k; i++)
		if (use[i])
			printf("%d ", i);
	printf("\n");

	return 0;
}