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.
[[-45, 68, -166, -7], [-110, 17, -151, 87, -185, -162, -47], [-192, -58, -161], [-46, -123, 12], [71, -24, -58, -183, -193, -146, 1], [23, 47, -44, 46, 51, 6, -24], [-162, -39, -119, -74, 37, 34], [-33, -142, 8, -120, 51, 22, -141]]