#include<fstream>
#include<vector>
#include<queue>
using namespace std;

ifstream cin("cmcm.in");
ofstream cout("cmcm.out");

const int nmax = 620, inf = 1000000000;

vector<int> g[nmax];
int n,m,edges,c[nmax][nmax],cost[nmax][nmax],f[nmax][nmax],edge[nmax][nmax];
int dist[nmax],p[nmax];

int BellmanFord()
{
    queue<int>q;
    q.push(1);
    int i;
    for (i=1;i<=n+m+2;i++) dist[i]=inf;
    dist[1]=0;
    while (!q.empty())
    {
        int v=q.front(); q.pop();
        for (i=0;i<g[v].size();i++)
        {
            int to=g[v][i], len=cost[v][to];
            if (c[v][to]==f[v][to]) continue;
            if (dist[v]+len<dist[to])
            {
                dist[to]=dist[v]+len;
                q.push(to);
                p[to]=v;
            }
        }
    }
    if (dist[n+m+2]>=inf) return  0;
    int fmin;
    for (i=n+m+2;i!=1;i=p[i])
        fmin=min(fmin,c[p[i]][i]-f[p[i]][i]);
    for (i=n+m+2;i!=1;i=p[i])
    {
        f[p[i]][i]+=fmin;
        f[i][p[i]]-=fmin;
    }
    return dist[n+m+2]*fmin;

}

void  Read_and_BuildGraph()
{
    cin>>n>>m>>edges;
    int i;
    for (i=1;i<=edges;i++)
    {
        int x,y,z;
        cin>>x>>y>>z;
        x++; y+=n+1;
        g[x].push_back(y);
        g[y].push_back(x);
        c[x][y]=1;
        cost[x][y]=z;
        cost[y][x]=-z;
        edge[x][y]=i;
    }
    for (i=2;i<=n+1;i++)
    {
        g[1].push_back(i);
        g[i].push_back(1);
        c[1][i]=1;
    }
    for (i=n+2;i<=n+m+1;i++)
    {
        g[n+m+2].push_back(i);
        g[i].push_back(n+m+2);
        c[i][n+m+2]=1;
    }
}

int main()
{
    Read_and_BuildGraph();
    int i,j;
   /* for (i=1;i<=n+m+2;i++)
    {
        for (j=0;j<g[i].size();j++) cout<<g[i][j]<<" ";
            cout<<"\n";
    }*/
    int cst=0,ok=1;
    while (ok)
    {
        ok=BellmanFord();
        cst+=ok;
    }
    int nr=0;
    for (i=2;i<=n+1;i++)
        for (j=n+2;j<=n+m+1;j++)
          if (edge[i][j] && f[i][j]) nr++;
    cout<<nr<<" "<<cst<<"\n";
    for (i=2;i<=n+1;i++)
        for (j=n+2;j<=n+m+1;j++)
            if (edge[i][j] && f[i][j]) cout<<edge[i][j]<<" ";
    return 0;
}