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.
[[22, 35, -155, -147, -25, -105], [-10, -81], [-140, 96], [9, -106, -50, -199, -48, -1], [30, 50, -35, -196]]