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.
[[-43, -20, -23, 8, -43, -182, -184], [-143, 27, -157, 24, 20, 58, -178], [1, -6, -41], [-125, -126, 79, 42, 99, -159], [39, -83, -44, -25, 55, -188, -47], [1, -110, -86, -146, 73, -45], [-140, -183, -21, -108, -5, -136]]