#include <bits/stdc++.h>

using namespace std;

const int inf=2e9;

struct edge
{
    int x,c,ind;
    bool operator <(const edge &aux) const
    {
        return c>aux.c;
    }
};

vector<edge> v[610];
int cap[610][610],dest,tata[610],dist[610],d[610],aux[610];
queue<int> q;
priority_queue<edge> mq;
char vaz[610];

void add_edge(int x,int y,int c,int i)
{
    v[x].push_back({y,c,i});
    v[y].push_back({x,-c,i});
    cap[x][y]=1;
}

void bellman()
{
    for(int i=0;i<=dest;i++) dist[i]=inf;
    dist[0]=0;
    vaz[0]=1;
    q.push(0);
    while(!q.empty())
    {
        int nod=q.front();
        vaz[nod]=0;
        q.pop();
        for(int i=0;i<v[nod].size();i++)
        {
            int vec=v[nod][i].x,c=v[nod][i].c;
            if(cap[nod][vec]>0 && dist[nod]+c<dist[vec])
            {
                dist[vec]=dist[nod]+c;
                if(vec!=dest && !vaz[vec]) {vaz[vec]=1;q.push(vec);}
            }
        }
    }
}

int go()
{
    for(int i=0;i<=dest;i++) d[i]=aux[i]=inf;
    d[0]=aux[0]=0;
    mq.push({0,0,0});
    while(!mq.empty())
    {
        int nod=mq.top().x,c=mq.top().c;
        mq.pop();
        if(d[nod]<c) continue;
        for(int i=0;i<v[nod].size();i++)
        {
            int vec=v[nod][i].x,c1=v[nod][i].c;
            if(cap[nod][vec]>0 && d[nod]+dist[nod]+c1-dist[vec]<d[vec])
            {
                d[vec]=d[nod]+dist[nod]+c1-dist[vec];
                aux[vec]=aux[nod]+c1;
                tata[vec]=nod;
                if(vec!=dest) mq.push({vec,d[vec],0});
            }
        }
    }
    for(int i=0;i<=dest;i++) dist[i]=aux[i];
    return d[dest]<inf;
}

int main()
{
    freopen("cmcm.in","r",stdin);
    freopen("cmcm.out","w",stdout);
    int n,m,e,x,y,c,flow=0,ans=0;
    scanf("%d%d%d",&n,&m,&e);
    for(int i=1;i<=e;i++)
    {
        scanf("%d%d%d",&x,&y,&c);
        add_edge(x,y+n,c,i);
    }
    dest=n+m+1;
    for(int i=1;i<=n;i++) add_edge(0,i,0,0);
    for(int i=1;i<=m;i++) add_edge(n+i,dest,0,0);
    bellman();
    while(go())
    {
        for(int nod=dest;nod!=0;nod=tata[nod])
        {
            cap[tata[nod]][nod]--;
            cap[nod][tata[nod]]++;
        }
        flow++;
        ans+=dist[dest];
    }
    printf("%d %d\n",flow,ans);
    for(int i=1;i<=n;i++)
        for(int j=0;j<v[i].size();j++)
            if(!cap[i][v[i][j].x] && v[i][j].x>0) printf("%d ",v[i][j].ind);
    return 0;
}