The fundamental counting principle math question

The Fundamental Counting Priciple is going to be used to count the odd​ non-repeating three-digit numbers in our number system. The digits come from the set​ {0,1,2,3,4,5,6,7,8,9}. The first digit​ (in the hundreds​ place) cannot be zero. Since the number is​ odd, the third digit​ (in the ones​ place) must come from the set​ {1,3,5,7,9}.
In order for the Fundamental Counting Principle to apply to this​ problem, this​ 3-part task must satisfy the uniformity​ criterion, meaning the number of choices for any particular part is the same no matter which choice were selected for the previous parts.  
The task of counting these numbers is going to be broken down into three parts. In which order must these be completed in order to satisfy the uniformity​ criterion?