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.
[[-66, 0, -183, -25, -71, 37, 4], [-176, -1, 85, -70, -175, 91], [-58, 38, 41, -34, 100, 77, 56], [87, -42, -183], [40, 88, -138, -25], [-196, 11, -168, -53, 67, -62], [13, -35, -4], [-98, -72, -70, 24, -21], [-168, -8, -185, -1, -66, -45]]