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.
[[-83, 99, 16, -6, -143, -88], [-52, -102, -78, -23, 20], [15, -14, -151, -154], [35, 44, -127, -142], [-42, 11, -161, -130, 67], [51, -18, -76, -94, -63], [10, -165, 54, -197], [-9, -131], [3, 56, -161, -102]]