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.
[[11, 28, -75, 69, -198], [90, -156, -145, 37, 28, -123], [-53, 38, -186, -103], [1, -76, -27, 35, 18, -173], [-190, -144, 48, -61], [-133, -190, -78, -192, -7, -111]]