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.
[[13, -200, -18, -33, -174], [-89, -53], [-141, -82, -102, 74], [-77, 42, -91, -136], [-160, -162, -196, -191, -3, -171], [-128, -115, 35, -175, -79, -164, -138], [-29, 29, -145, -20, 36, 62], [-62, -106, -49, -154, -100, -109, -56]]