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, -14, -165, 18, -26], [-33, -95, -34], [99, -49, -53, -125, -65, -87], [-164, -196, 19, 46], [54, 4], [-71, -155, 33, 74, -65, -167, -175], [71, -56, 97, -112], [-95, -10], [-190, -44, -151, -41, -83, 4, 72]]