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.
[[43, -46], [-161, 68], [-140, 78, -23, 11], [19, -113], [-37, -124, -88, -12, 89], [-10, -185, -142, -28, -173, -37], [-89, 63, 53], [63, 32, -19, -105]]