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.
[[48, -26], [86, 65, -135, -88, -123, -118], [-158, -26], [16, -134, -84], [-71, -105, 83, 55, -41, -54], [-81, 32, -200, -81, -41], [-198, 3, 19, -86, -43, -179]]