In this task, you are given inputs i,j, and A, where i and j are integers and A is a list. You need to return the sum of all the numerical elements in the list A between the positions i and j (including positions i and j). Return 0 if no numerical element is present in the list between the given ranges. i and j will be non-negative, and will always have a value less than the length of A. i will always be less than j.
8, 12, ['k', 'I', 'r', '4253', 'B', 'j', '9905', 'q', '6079', '9631', '8985', 'I', 'E', '6747', 'G', 'h', 'a', '7967', 'A', '8757', '8173', '1651', 'm', 'S', 'm']