Efficient Recruiting Problem

Given $n$ sports and $m$ counselors, is it possible to hire at most $k$ counselors such that all sports are covered assuming each counselor is skilled at some amount of hte $n$ sports?