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.
[[-113, -189, -75], [38, -38, 60, 46], [66, 66, 46, -10, 84, -75, -46], [56, -38, -95, -11, 6, -155, -175]]