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.
[[-180, 62, 11, 38, -18, -54, 14], [-152, -96, -97, 71, -31], [-195, -142, -75, 42, 84, -25], [-195, -187, 79, -163, -197], [-130, -182, 93, -74], [-183, -43, -42, 28, -125], [-124, -77, -38, -199, 99, -179], [36, -50, 44]]