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.
[[-53, -60, -39, -162], [7, -93, 74, 15], [77, 52, -188, -39], [-9, -64, 65, -196, -16], [-157, -133], [-79, 66], [-168, 92, -129, -125, -189, -135, -18], [-193, 9, 40, -54, -139]]