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.
[[40, 96, -10, -167, 17, -74], [62, -52, -157, -16, -41, 37, 0], [75, -62, 19, -95, 99], [74, -2, -8, -119, 78], [-164, -33, -50, 10, 49], [36, 3, -29, -32, -89], [-80, -58, -62], [20, -148, 20, 97, 60, -142, -71], [57, -103, -133]]