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: 1, 6, ['3309', 'w', '1143', 'D', 'Z', 'd']

A: 4452
****
Q: 2, 10, ['2797', 'm', '439', '5677', '6719', '1587', 'I', 'I', 'w', '8483', '7341', '341', 'H', 'K', '7727', '4467', 'L']

A: 22905
****
Q: 9, 18, ['4269', '3293', 'K', 'z', 'M', '9197', '1739', 'K', '5213', 'd', 't', 'a', 'a', 's', 'l', '8243', 'v', '5071', '5963', '669', 'Q', '3973']

A:
18527
****