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.
[[-108, -143, -34, -171, 48, 26, 29], [-55, -176, -29, -169], [-96, 99, 31, -149, -7, -112], [78, -136, -50, -47], [-58, -125, 100], [-112, -157, -67, -56, 73, 35, -88]]