program queue1;


var
  tmax, t, n, a, b, tm, i, maxsize, size, a1, ii, q: integer;
  queue: array of integer;
begin
  Assign(input, 'input.txt');
  Assign(output, 'output.txt');
  reset(input);
  rewrite(output);
  Read(tmax, n);
  setlength(queue, n);
  Read(a, b);
  queue[0] := a + b;
  t := 0;
  size := 0;
  for i := 1 to n - 1 do
  begin
    Read(a, b);
    if a >= queue[t] then
    begin
      t += 1;
      if queue[size] <= a then
        queue[size + 1] := a + b
      else
        queue[size + 1] := queue[size] + b;
      size += 1;
      while a >= queue[t] do
      begin
        t += 1;
        q := size - t + 1;
      end;
    end
    else
    begin
      if queue[size] <= a then
        queue[size + 1] := a + b
      else
        queue[size + 1] := queue[size] + b;
      size += 1;
      q := size - t ;
    end;
    if q > maxsize then
      maxsize := q;
  end;
  if queue[size]>tmax then
    write(maxsize,' ',tmax)
  else write(maxsize,' ',queue[size]);
  Close(input);
  Close(output);
end.