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.
[[-2, -5, 24, 0], [-26, -50, -122, -50, -183, -1], [-38, -145, 50, -151, -137, 90, -109], [-136, 25, 60, -56, -169, -83, 47], [-21, 8, -83, -4, -54, -49], [-21, -107, -55, -5, -153, -24]]