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: 4, 4, ['t', 'Z', '8689', 'I', '5589', 'H', 'Z']

A: 0
****
Q: 2, 3, ['o', 'p', '4765', 'u', '629', 'p']

A: 4765
****
Q: 1, 20, ['5951', '3063', 'J', '8323', 'f', 'e', '8923', 'O', '8863', '2807', '5581', '2857', '2979', '4419', '695', '9249', '583', '2325', 'l', 'G', 'X']

A:
66618
****