program name
    use,intrinsic :: iso_fortran_env
    implicit none
    integer(int64):: n,c,k,i,d_buss,cnt,notteru
    integer(int64), allocatable:: t(:)

    read*, n,c,k
    allocate(t(n))
    do i=1,n
        read*, t(i)
    end do
    call merge_sort(t,1_8,n)
    d_buss=0
    cnt=0
    notteru=0
    do i=1,n
        if (d_buss < t(i)) then
            d_buss=t(i)+k
            cnt=cnt+1
            notteru=0
        else
            if (notteru >= c) then
                d_buss=t(i)+k
                cnt=cnt+1
                notteru=0
            end if
        end if
        notteru=notteru+1
    end do
    print'(i0)', cnt
contains
    recursive subroutine merge_sort(ar, fst, lst)
        integer(8),intent(inout):: ar(:)
        integer(8),intent(in):: fst,lst
        integer(8):: mdl

        if (lst-fst < 2) then
            if (ar(fst) > ar(lst)) call swap(ar(fst),ar(lst))
            return
        end if

        mdl = (fst+lst)/2
        call merge_sort(ar, fst, mdl)
        call merge_sort(ar, mdl+1, lst)
        call merge_(ar, fst, mdl, lst)
    end subroutine

    subroutine merge_(ar, fst, mdl, lst)
        integer(8),intent(inout):: ar(:)
        integer(8),intent(in):: fst, mdl, lst
        integer(8),allocatable:: tmp(:)
        integer(8):: li, ri, ti

        allocate(tmp(lst-fst+1))

        li=fst
        ri=mdl+1   
        ti=1

        do while (li <= mdl .and. ri <= lst)
            if (ar(li) <= ar(ri)) then
                tmp(ti) = ar(li)
                li=li+1
            else
                tmp(ti) = ar(ri)
                ri=ri+1
            end if
            ti=ti+1
        end do

        if (li <= mdl) then
            tmp(ti:) = ar(li:mdl)
        else
            tmp(ti:) = ar(ri:lst)
        end if

        ar(fst:lst) = tmp(:)
        deallocate(tmp)
    end subroutine

    subroutine swap(x,y)
        integer(8),intent(inout):: x,y
        integer(8):: tmp
        tmp = x
        x = y
        y = tmp
    end subroutine

end program name