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.
[[-176, -188, -117, 16, -93, 50, -111], [98, -7, -34, -98, -146], [-109, 48, -100], [-170, 22, -50, -178, 49, 22, -88], [-105, 69, -146, -138], [-28, -85, -114, 12, -39, 71], [1, 69, -14, 78, -61], [-195, -145], [-10, -174, 10, 45, 53]]