Task: Question Decomposition
Input (English): question: Find the year that has the most number of matches.
Output (English): #1 return years 
#2 return matches in #1 
#3 return number of  #2 for each  #1 
#4 return #1 where #3 is  highest