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.

Q: 11, 15, ['W', '8193', '2581', 'f', 'j', '5727', 'A', '6177', 'u', '4201', 'T', 'w', 'C', 'u', '7973', 'd', 'c']

A: 7973
****
Q: 6, 6, ['V', '8015', 'N', 'O', 'Z', 'V', 'v']

A: 0
****
Q: 1, 11, ['9849', 'W', 'a', 'b', 'e', '7719', 'P', 'j', 'Q', '8199', 'Z', '7609', '3569', 'U', '6325']

A:
25767
****