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, 87, 37, -136, 8], [81, 52, 54, 17, 30, -35], [-73, -188, -136], [-2, -48, -191], [42, -171, 28, 9], [-119, -128, 7, 73, -163, -17, -186], [-6, -197, 16, -26]]