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.
[[88, 78], [-159, -146, -152], [-124, -9], [78, 26, -14, -93, -179, 67], [-70, -33, -61, -52, 9, -194, 19], [-26, 28, -198, -134, -67, -59], [-30, -86, -28, -9], [91, -11, -72, -182], [-121, -123, -81, -147]]