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.
[[-72, -146, 16, 8, -119], [-74, 17, -51, -60], [-161, 74, -38, -158, -58, -22, -113], [95, -43, 0, 46, -79, 60], [20, -84], [-13, 55, -51, -121], [78, -106, -51, -161, -102, -90, 11], [-30, -39, -86]]