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.
[[-180, -195, -121, 32, -71, 3, -183], [-191, -44], [-59, -143, -10, 69, -98, -105, -123], [13, -145, -170, -36, -78, -3, -118], [-10, -59], [42, -177, 57, -178], [7, -55, -120, -13, -126, 20, -171], [-6, 46], [-47, 90, 84, 89]]