uses
  sysutils, math;
const
  eps = 1e-8;
  maxn = 1000;

var
  z: array[1..maxn] of boolean;
  a: array[1..maxn, 1..maxn] of boolean;
  r: array[1..maxn] of integer;
  n: integer;

function go(i: integer): boolean;
var
  j: integer;
begin
  if z[i] then begin
    go := false;
  end else begin
    z[i] := true;
    for j := 1 to n do if a[i, j] and (r[j] <> i) then begin
      if r[j] = 0 then begin
        go := true;
        r[j] := i;
        exit;
      end else begin
        if go(r[j]) then begin
          go := true;
          r[j] := i;
          exit;
        end;
      end;
    end;
    go := false;
  end;
end;

var
  v, i, j, k: integer;
  ch: char;
  t, x, y: array[1..maxn] of integer;

begin
  reset(input, 'input.txt');
  rewrite(output, 'output.txt');
  read(n, v);
  for i := 1 to n do
  begin
   if not seekeof then read(ch);
    j := strtoint(ch);
    read(ch);
    j := j * 10 + strtoint(ch);
    read(ch);
    assert(ch = ':');
    read(ch);
    j := j * 6 + strtoint(ch);
    read(ch);
    j := j * 10 + strtoint(ch);
    t[i] := j;
    read(x[i], y[i]);
  end;

  for i := 1 to n do begin
    for j := 1 to n do if (i <> j) then begin
      if (t[j] - t[i]) * v / 60 >= hypot(x[i] - x[j], y[i] - y[j]) - eps then
        a[i, j] := true
      else
        a[i, j] := false;
    end;
  end;

  fillchar(r, sizeof(r), 0);

  k := 0;
  for i := 1 to n do begin
    fillchar(z, sizeof(z), 0);
    if go(i) then inc(k);
  end;


  writeln(n - k);

end.