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.
[[-123, 100, -7], [44, -173, 33, -17], [-37, -151, -46, 86], [-192, -26, -56, -188], [97, -39, -35, -47, -136, -103, -149], [-1, -86, -152, -64, -184], [-47, 43, -81, -18, -89, 26], [-19, 26, 32, 10]]