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.
[[-16, -122, -165, -24, -65], [54, -101, -193, -96, -38, 62], [39, 97, -8], [-107, 17, -54], [-151, -180, 85], [-115, -190, -121, -172, 96, -79, -149], [33, 3, 99, -105, -146, 59], [-131, -186, -36, -199, -102, 41, -36]]