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.
[[-11, -42, -107, -154, -8, -110, 74], [81, -47, 64, -135, 69], [-39, 94, -135, -105], [-30, 58, 69, -175, 10, 94, -176], [20, -54, 32, 95, -113], [-192, -156, -9, -136, 84, -77, -128], [-11, -183, 14, -50, -56, -122], [83, -70], [46, -137, 70, 28, 25, -176, -103]]