#include <bits/stdc++.h>

using namespace std;

ifstream f("cmcm.in");
ofstream g("cmcm.out");

int N,max_flow,cost_ans,inCoada[610],tata[610],cost_bell[610],cost_dijk[610],new_cost_bell[610],C[610][610],cost[610][610],flux[610][610];
bool fv[50100];
vector < pair < int , int > > v[610];
priority_queue < pair < int , int > , vector < pair < int , int > > , greater < pair < int , int > > > h;
queue <int> q;

void Bellman()
{
    for(int i=0;i<=N;i++)cost_bell[i]=INT_MAX/2;

    cost_bell[0]=0;
    q.push(0);
    inCoada[0]=1;

    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        inCoada[nod]=0;

        for(int i=0;i<v[nod].size();i++)
        {
            int vecin=v[nod][i].first;
            if(flux[nod][vecin]<C[nod][vecin] && cost_bell[vecin]>cost_bell[nod]+cost[nod][vecin])
            {
                cost_bell[vecin]=cost_bell[nod]+cost[nod][vecin];
                if(inCoada[vecin]==0)
                {
                    inCoada[vecin]=1;
                    q.push(vecin);
                }
            }
        }
    }
}

int Dijkstra()
{
    for(int i=0;i<=N;i++)
    {
        cost_dijk[i]=INT_MAX/2;
        new_cost_bell[i]=INT_MAX/2;
        tata[i]=-1;
    }

    cost_dijk[0]=0;
    new_cost_bell[0]=0;
    h.push({0,0});

    while(!h.empty())
    {
        int nod=h.top().second;
        int min_cost=h.top().first;
        h.pop();

        if(cost_dijk[nod]==min_cost)
        {
            for(int i=0;i<v[nod].size();i++)
            {
                int vecin=v[nod][i].first;
                int ind_mch=v[nod][i].second;
                int cost_intre=cost[nod][vecin]+cost_bell[nod]-cost_bell[vecin];
                if(flux[nod][vecin]<C[nod][vecin] && cost_dijk[vecin]>cost_dijk[nod]+cost_intre)
                {
                    cost_dijk[vecin]=cost_dijk[nod]+cost_intre;
                    new_cost_bell[vecin]=new_cost_bell[nod]+cost[nod][vecin];
                    tata[vecin]=nod;
                    h.push({cost_dijk[vecin],vecin});
                }
            }
        }
    }

    if(cost_dijk[N]==INT_MAX/2)return 0;

    int nod=N;
    while(tata[nod]!=-1)
    {
        flux[tata[nod]][nod]++;
        flux[nod][tata[nod]]--;
        nod=tata[nod];
    }

    max_flow++;
    cost_ans+=new_cost_bell[N];

    for(int i=0;i<=N;i++)new_cost_bell[i]=cost_bell[i];
    return 1;
}

int n,m,e,i,x,y,z;
int main()
{
    ios_base::sync_with_stdio(false);

    f>>n>>m>>e;
    for(i=1;i<=e;i++)
    {
        f>>x>>y>>z;
        y+=n;
        v[x].push_back({y,i});v[y].push_back({x,i});
        cost[x][y]=z;cost[y][x]=-z;
        C[x][y]=1;
    }

    N=n+m+1;
    for(i=1;i<=n;i++)
    {
        v[0].push_back({i,0});v[i].push_back({0,i});
        cost[0][i]=cost[i][0]=0;
        C[0][i]=1;
    }

    for(i=n+1;i<=n+m;i++)
    {
        v[i].push_back({N,0});v[N].push_back({i,0});
        cost[i][N]=cost[N][i]=0;
        C[i][N]=1;
    }

    Bellman();
    while(Dijkstra());

    g<<max_flow<<" "<<cost_ans<<'\n';
    for(i=1;i<N;i++)
    {
        for(int j=0;j<v[i].size();j++)
        {
            int vecin=v[i][j].first;
            int mch_ind=v[i][j].second;
            if(flux[i][vecin]==1 && mch_ind!=0)g<<mch_ind<<" ";
        }
    }
    return 0;
}