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, -54, 41, 11], [-118, -162, 65, 96, 74], [-163, -160, -197, -193, -12], [-104, -23, -55, 41, -151, 77], [-191, -9, -90], [-136, -47, 62, -74, -24, -20, -47]]