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.
[[-158, -146, -59, -67, 3], [-56, 45, -149, -102], [82, -80, -142, 32, -42, -35], [-160, 5, 9, -146, -166, -61], [-76, -38, -9, -81, -80, 54, -171]]