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.
[[-38, 39, -146, -131, 56], [93, -51, 10, 76, -73, -106, -198], [-145, 59, -15, 24, -167, -55], [34, -116, 49, 40, -187, 69], [-79, 97, -134, -180], [-30, -53, -130, -169, 27, -140], [43, -81, -195, -122], [-159, -147, -78, -37, -118, -20, 99], [-68, 86, 0, -84, -92]]