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.
[[-144, -116, -168, -126], [61, 0, -14, -37, -143, -27, -107], [-43, -142], [99, 80, -10, -14, -193, 12, -157], [-91, -120, -178], [-72, -71, 99, -97, -28, -182, -76], [-200, -182, -19, -129, -42, -92, -84], [-14, -60, -71], [14, -154, 46, 48, 88]]