A small college with 1{,}2001,2001, comma, 200 total students has a student government of 404040 members. From its members, the student government will elect a president, vice president, secretary, and treasurer. No single member can hold more than 111 of these 444 positions. The permutation formula n\text{P}rnPrn, start text, P, end text, r can be used to find the number of unique ways the student government can arrange its members into these positions.
What are the appropriate values of nnn and rrr?