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.
[[64, 36, -180, 75, -124, -36, 78], [66, -22, -159, -55], [89, -106, 72, -42, -142, -39, -8], [-120, -42, -94, -5, -53, 36, 18], [30, -190, -197, -53, -67], [-66, -115, 100, -128]]