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.
[[-4, 26], [-189, -190, 60, 7, 28], [-1, -18, 68, -182, -86, -26, -6], [-156, -101, -137, -34, 30, -113, -68], [96, -106, 39], [-56, -144, 95, 28], [-89, -186, 49, -159]]