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.
[[-55, -126, -3, -2, -191, -81], [7, -116, 9, 34], [66, -158, 27, 41, -78, -62], [80, -24, 84, -143, 60, 87], [-56, -170, -154, -178], [52, -191, -103, 50, 7, -69, 85], [-194, -150, 6, -183, -195, -136], [-160, -16, -3]]