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.
[[58, -19, -153, 13, -90], [-69, -140], [93, -101, -105], [-159, 63, 34], [-91, -6, -17, -68, -180, 19, -109], [-164, -77, -75, -143, -150, 79, 31], [61, -120, -134, 60, -121, -181], [-114, -165, 55, -48, -106, -47], [-144, 33, -7, -119, -49, -80]]