Let $n,k$ be positive integers, satisfying $n$ is even, $k\geq 2$ and $n>4k.$ There are $n$ points on the circumference of a circle. If the endpoints of $\frac{n}{2}$ chords in a circle that do not intersect with each other are exactly the $n$ points, we call these chords a matching.Determine the maximum of integer $m,$ such that for any matching, there exists $k$ consecutive points, satisfying all the endpoints of at least $m$ chords are in the $k$ points.