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.
[[42, 70], [-108, 19, 3, 38, -80], [-80, -151, -134, -21, -131], [91, -105, -83, -13], [-104, -114, -140, 80, -165], [88, -112, 2, -94, -67], [-62, -9, -61, -110], [12, -81, 77, -75], [53, -34, -77, -31, -13, -156]]