In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.
[[25, -166, -161], [-15, 78, -116, -58, -32, -121], [-22, -99], [6, -59, 38, -109, -15, 97], [-125, 81, 86, 18, -173], [-113, 41, -108, 14, -117]]