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.
[[70, -119], [59, -56, -163, 43, -117, 51, -46], [-28, -96, 90], [-84, -195, -10, 48, -172, -175], [-187, -13, -179, -180, 16, 89], [-45, 38, -64, -192, 6, -13], [-184, -191, -151, -71]]