Task: Question Decomposition
Input (English): question: What is the largest and smallest customer codes?
Output (English): #1 return customer codes 
#2 return #1 that  is  largest 
#3 return #1 that  is  smallest 
#4 return #2 ,  #3