#include<fstream>
#include<vector>
#include<bitset>
#include<deque>
#define DIM 610
using namespace std;
int n, m, e, i, x, y, cost, u, minim, sum, smin, nr, s, d;
int sd[DIM], t[DIM], sol[50005];
int c[DIM][DIM], f[DIM][DIM], z[DIM][DIM];
deque<int> cd;
vector<int> v[DIM];
bitset<DIM> viz;
pair<int, int> p[50005];
ifstream fin("cmcm.in");
ofstream fout("cmcm.out");
int bf(){
    int i, nod, vecin;
    int ok = 0;
    for(i = 1; i <= d; i++){
        sd[i] = 1000000000;
        viz[i] = 0;
    }
    cd.clear();
    viz[s] = 1;
    cd.push_back(s);
    sd[s] = 0;
    t[0] = -1;
    while( !cd.empty()){
        nod = cd.front();
        viz[nod] = 0;
        for(i = 0; i < v[nod].size(); i++){
            vecin = v[nod][i];
            if(sd[vecin] > sd[nod] + z[nod][vecin] && f[nod][vecin] < c[nod][vecin]){
                sd[vecin] = sd[nod] + z[nod][vecin];
                t[vecin] = nod;
                if(viz[vecin] == 0){
                    viz[vecin] = 1;
                    cd.push_back(vecin);
                }
                if(vecin == d){
                    ok = 1;
                }
            }
        }
        cd.pop_front();
    }
    return ok;
}
int main(){
    fin>> n >> m >> e;
    for(i = 1; i <= e; i++){
        fin>> x >> y >> cost;
        y += n;
        v[x].push_back(y);
        v[y].push_back(x);
        c[x][y] = 1;
        z[x][y] = cost;
        z[y][x] = -cost;
        p[i].first = x;
        p[i].second = y;
    }
    s = 0;
    d = n + m + 1;
    for(i = 1; i <= n; i++){
        v[s].push_back(i);
        v[i].push_back(s);
        c[s][i] = 1;
    }
    for(i = n + 1; i < d; i++){
        v[i].push_back(d);
        v[d].push_back(i);
        c[i][d] = 1;
    }
    while( bf() ){
        minim = 1000000000;
        for(u = d; t[u] >= 0; u = t[u]){
            minim = min(minim, c[ t[u] ][u] - f[ t[u] ][u]);
        }
        for(u = d; t[u] >= 0; u = t[u]){
            smin += minim * z[ t[u] ][u];
            f[t[u]][u] += minim;
            f[u][t[u]] -= minim;
        }
        sum += minim;
    }
    for(i = 1; i <= e; i++){
        x = p[i].first;
        y = p[i].second;
        if(f[x][y] == 1){
            nr++;
            sol[nr] = i;
            //smin += z[x][y];
        }
    }
    fout<< sum <<" "<< smin <<"\n";
    for(i = 1; i <= nr; i++){
        fout<< sol[i] <<" ";
    }
    return 0;
}