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, 5, ['t', '9215', 'K', 'Q', 'w']
[A]: 0


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


[Q]: 4, 8, ['c', '7549', '7865', 'p', '7055', '4759', 'p', 'g', '3931', 'A']
[A]:
11814