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.
[[90, 86, -163, 68, 100], [-157, -169, -3, -5], [-127, -27, 28, -26, 38], [-37, -161], [-141, -168, -5, -138, -49, -155, -139], [-118, -16, -199, -91, -38, -92, -138], [-145, 17, 6, -120, -59, -183], [-104, -154, -11, 18], [-8, -75, -7, -50, -197, 43]]