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.

9, 13, ['x', '4589', 'q', 'X', 'Q', 'e', '8007', '5779', 'Z', '8503', 's', '6425', '133', '5389', 'e', '9477', '3763', 'Q', 'B', 'r', 'P']
15061

4, 5, ['b', 'u', '5279', '6945', '6631']
13576

8, 11, ['y', 'G', '6691', 'p', '2133', 'K', 'j', 'E', 'F', 't', '6757', 'I', '2261', '5269', '2811', 'W', 'd', 'g', 'r']

6757