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.
[[34, -28, -82, 73, -107, -173], [-23, -123, -142, 26, -22, -200, -131], [-142, -55, -194, 81, -194, -19, -19], [-53, -97, 48, -30, -189, -9, -22], [-117, 31, -8, -83], [25, -11], [34, -163, -82, 44, -43, 16], [-124, -84, 31, 10, 30]]