Multiple capture of a given number of evaders in the problem of a simple pursuit

In the finite-dimensional Euclidean space, the problem of a group of pursuers pursuing a group of evaders is considered, which is described by the system
$$\dot z_{ij} = u_i - v_j,\quad u_i, v_j \in V.$$
The set of admissible controls is a convex compact, and the target's sets are the origin of coordinates. The aim of the group of pursuers is to carry out an $r$-fold capture of at least $q$ evaders. Additionally, it is assumed that the evaders use program strategies and that each pursuer can catch no more than one evader. We obtain necessary and sufficient conditions for the solvability of the pursuit problem. For the proof we use the Hall theorem on the system of various representatives.