There are a number of papers in the literature that have proved generating functions for permutations and signed permutations according to the number of descents. We shall show how to generalize many of these type of results to get generating functions for permutations and signed permutations whose descent set contains a prespecified set S according to the number of descents. Our results will generalize previous results of Carlitz, Stanley, Foata, Han, and others.