var
g,next,mo,x,y,pre,xx,yy:array[0..10000]of longint;
f:array[0..10000]of boolean;
n,i,j,m,s,t,a,b,c,tx,ty,ans:longint;

function dfs(a:longint):boolean;
var
e,b:longint;
begin
    e:=g[a];
    while e<>0 do begin
        b:=mo[e];
        if not f[b] then begin
            f[b]:=true;
            if (yy[b]=0) or (dfs(yy[b])) then begin
                yy[b]:=a;
                exit(true);
            end;
        end;
        e:=next[e];
    end;
    exit(false);
end;

begin
assign(input,'lovetravel.in');reset(input);
assign(output,'lovetravel.out');rewrite(output);
    read(n,m,s);
    for i:=1 to s do begin
        read(a,b,c);
        if not f[a] then begin
            f[a]:=true;
            inc(tx);x[tx]:=a;
        end;
        if not f[b] then begin
            f[b]:=true;
            inc(ty);y[ty]:=b;
        end;
        inc(t);
        next[t]:=g[a];g[a]:=t;mo[t]:=b;
        inc(t);
        next[t]:=g[b];g[b]:=t;mo[t]:=a;
    end;
    for i:=1 to tx do begin
        fillchar(f,sizeof(f),false);
        if dfs(x[i]) then inc(ans);
    end;
    writeln(0,' ',n-ans);
close(input);close(output);
end.