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.
[[-163, -82, -43, 58, 28, 67], [-162, -189, 49], [26, -149, 47, -40, -84, -24], [95, -164, 29, -22, -15, -28, 58], [39, 45, -104, -72, 56, -168, -29]]