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.
[[5, -85, -159, -30, 20, 56], [-72, -103, 7, -191, -160, 9, 77], [-153, -125, -15, -9, -161, -198, -146], [-145, 99, -64, -55, -197, -158, -7], [69, -104, -84, 84, -129, -4], [-109, -30, -159], [80, -25, -101, 60], [-115, -160, 19, -18, 55, -12]]