uses crt;
type int = longint;

procedure Taotest;
const Lim = 1 shl 32;
var i, n, m, t: int;
    a, b, c: int;
begin
    randomize;
    assign(output, 'CAU2.INP'); rewrite(output);
    readln(n, m);
    writeln(n, ' ', m);
    for i:=1 to m do begin
        a:=random(Lim) mod n + 1;
        b:=random(Lim) mod n + 1;
        if a > b then begin
            t:=a; a:=b; b:=t;
        end;
        c:=random(Lim) mod 1000 + 1;
        writeln(a, ' ', b, ' ', c);
    end;
    close(output);
end;

var f: array[0..2000000 + 6] of int;
    i, n, m, maxF: int;
    a, b, c: int;
begin
    // Taotest;
    assign(input, 'CAU2.INP'); reset(input);
    assign(output, 'CAU2.OUT'); rewrite(output);
    
    readln(n, m);
    for i:=0 to n + 1 do f[i]:=0;
    for i:=1 to m do begin
        readln(a, b, c);
        if not((1 <= a) and (a <= b) and (b <= n) and (1 <= c) and (c <= 1000)) then exit;
        inc(f[a], c);
        dec(f[b + 1], c);
    end;
    
    maxF:=0;
    for i:=1 to n do begin
        inc(f[i], f[i - 1]);
        if maxF < f[i] then maxF:=f[i];
    end;
    
    c:=0;
    for i:=1 to n do 
        if f[i] = maxF then inc(c);
    writeln(maxF, ' ', c);
    close(input); close(output);
end.