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.
[[-148, 96, 22, -15, -148, -21], [92, 16, -19, 21, -79, -91, -58], [56, 45, -159, -53, -32, -92, -143], [-154, 7, -180, -189], [-162, -149], [-157, -176, 92, -91], [-22, -19, -76, -198, 94]]