A candy store has 100 pieces of candy to give away. When you get to the store, there are five people in front of you, numbered from 1 to 5. The i th person in line considers the set of positive integers congruent to i modulo 5 which are at most the number of pieces of candy remaining. If this set is empty, then they take no candy. Otherwise they pick an element of this set and take that many pieces of candy. For example, the first person in line will pick an integer from the set \{1,6, \ldots, 96\} and take that many pieces of candy. How many ways can the first five people take their share of candy so that after they are done there are at least 35 pieces of candy remaining?