Efficient Recruiting Problem

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