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, -166, -94, -14, -200], [-104, -185, 96, 54], [-35, -139, -20, -147, -184], [-11, -105, 40], [77, 90, -54, -28, 96], [60, -191, 50, -165, 34, -162], [57, 23, -87, -193, -145, -43], [44, -16, 60, -156]]