We consider a two-sided many-to-one matching model where universities offer scholarships to students. We show that every stable matching rule is manipulable by a university via destroying endowments under a fairly wide class of scholarship rules. Furthermore, we show that the set of Nash equilibria of the destruction game and the set of stable matchings may be disjoint.