#include <cstdio>
#include <queue>
#include <algorithm>

using namespace std;

const int inf=1e9;

struct edge
{
    int nod,cost;
    bool operator <(const edge aux) const
    {
        return cost>aux.cost;
    }
};

queue<int> h;
vector<edge> v[610];
priority_queue<edge> q;
int sursa,dest,cap_flow[610][610],poz[610][610],d[610],dist[610],dist1[610],tata[610],nr,vaz[610];

void bellman_ford()
{
    for(int i=0;i<=nr;i++) dist[i]=inf;
    dist[sursa]=0;
    vaz[sursa]=1;
    h.push(sursa);
    while(!h.empty())
    {
        int nod=h.front();
        vaz[nod]=0;
        h.pop();
        for(int i=0;i<v[nod].size();i++)
        {
            int vec=v[nod][i].nod,c=v[nod][i].cost;
            if(cap_flow[nod][vec]>0 && dist[nod]+c<dist[vec])
            {
                dist[vec]=dist[nod]+c;
                if(vec!=dest && vaz[vec]==0) {vaz[vec]=1;h.push(vec);}
            }
        }
    }
}

int dijkstra()
{
    for(int i=0;i<=nr;i++) dist1[i]=d[i]=inf;
    d[sursa]=dist1[sursa]=0;
    q.push({sursa,0});
    while(!q.empty())
    {
        int nod=q.top().nod,cost=q.top().cost;
        q.pop();
        if(d[nod]!=cost) continue;
        for(int i=0;i<v[nod].size();i++)
        {
            int vec=v[nod][i].nod,c=v[nod][i].cost;
            if(cap_flow[nod][vec]>0 && d[nod]+dist[nod]+c-dist[vec]<d[vec])
            {
                d[vec]=d[nod]+dist[nod]+c-dist[vec];
                dist1[vec]=dist1[nod]+c;
                tata[vec]=nod;
                if(vec!=dest) q.push({vec,d[vec]});
            }
        }
    }
    for(int i=0;i<=nr;i++) dist[i]=dist1[i];
    return d[dest]<inf;
}

int main()
{
    freopen("cmcm.in","r",stdin);
    freopen("cmcm.out","w",stdout);
    int n,m,e,flux=0,sol=0,x,y,c;
    scanf("%d%d%d",&n,&m,&e);
    for(int i=1;i<=e;i++)
    {
        scanf("%d%d%d",&x,&y,&c);
        y+=n;
        v[x].push_back({y,c});
        v[y].push_back({x,-c});
        poz[x][y]=i;
        cap_flow[x][y]=1;
    }
    sursa=0;dest=n+m+1;
    for(int i=1;i<=n;i++)
    {
        v[sursa].push_back({i,0});
        v[i].push_back({sursa,0});
        cap_flow[sursa][i]=1;
    }
    for(int i=n+1;i<=n+m;i++)
    {
        v[i].push_back({dest,0});
        v[dest].push_back({i,0});
        cap_flow[i][dest]=1;
    }
    nr=n+m+1;
    bellman_ford();
    while(dijkstra())
    {
        for(int nod=dest;nod!=sursa;nod=tata[nod])
        {
            cap_flow[tata[nod]][nod]--;
            cap_flow[nod][tata[nod]]++;
        }
        flux++;
        sol+=dist[dest];
    }
    printf("%d %d\n",flux,sol);
    for(int i=1;i<=n;i++)
        for(int j=0;j<v[i].size();j++)
            if(v[i][j].nod!=sursa && cap_flow[i][v[i][j].nod]==0) printf("%d ",poz[i][v[i][j].nod]);
    return 0;
}