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.
28, 29, ['Z', 'd', 'J', 'b', '4887', '4673', 'n', '3161', '9191', 'u', 'r', 'i', 'd', 'v', 'W', 'j', 'E', 'U', 'J', '957', 'a', 'B', '795', 'J', '6941', 'v', '4011', '9411', '4245', '2289']