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.
[[-85, 48, -97, 0], [-2, -180, -198, -7, 9], [20, -176, -158, -159], [-153, -63, -178, -18], [-156, 49, -10, 8, -104], [-14, 97, -138], [-103, -133, -191, -136, -71, -66, -59], [-45, 30, -123], [16, -34, -190, 39, -133]]