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, -189, -6, -184, 74, 18], [-160, -185, -30, -97, 40, -60, 57], [-123, -53, -139, -124, 25, 34], [-16, 81, -120, -64, 11, -185], [-52, 42, -157, -79, 36, 27], [-101, -57, -150], [-20, -143, -169, -114, -76, -127], [-130, -90], [68, -169]]