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.
[[-167, -148, -47, -59, -142, 79], [-196, -80, -158, -49, 98, -123], [-43, -173, 16, -96, -31], [-44, -110, -123, -19], [34, -149], [100, -32, 63, -110, 16, -16]]