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.
[[-105, 16, -118, -91], [-67, 19], [-178, -6], [-186, -162, 39, -103, 66, -75], [45, -84, -118, 87, -112, 18], [-167, -15, -126, -156], [-142, -199], [23, -11]]