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.
[[75, 25, -93], [-170, 16, -114, -81, -76, -11], [-192, 25, -99, 41, -133, -139], [65, 23], [-193, 25, 49, -75], [20, 21, -77], [-130, -60, -132, 26, -184], [-165, -12, -187, -88, -157, 26, -87], [40, -116]]