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.
[[-36, 89, -165], [-89, 13, -182], [-80, -193, -73, 10, 89, -93, 55], [-25, 62, -51, 84, -104], [-101, 81, -164, -91, -72, -168, -79], [51, -97, -67, 17, 74], [-160, -147, -50, -144, -61], [-29, 24, -82, -39, -94, -189, -125], [8, -175, -21]]