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.
[[11, 25, -34], [-148, -122], [-51, -189, 34, 9, 67, -133], [43, 15, -58, -193, 52, -3, 97], [-187, -39, -96, 97, -181, -87], [-27, -195, -132], [-70, -173, -117, -8], [100, -125, -180, 69], [-61, -94, 9, -49, -108, -178]]