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.
[[9, -66, -159, -38, 26], [100, -190, -18, 17, -107], [-77, -100, -95, -8], [-129, -11, 96, -73, 94, 13, 4], [-200, -4], [70, 18, -39], [-200, -172, -99, -182, -61], [44, -197], [96, -4, -65, -10]]