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.
[[-76, -28, -113, -117, -88], [65, -151, -144, 74], [85, -33, 18, 30, -79, 61], [-119, -166, 19], [-20, -38, -170], [-100, -156, -40, -157, -160], [44, 33, -138, -101]]