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]: 2, 10, ['2797', 'm', '439', '5677', '6719', '1587', 'I', 'I', 'w', '8483', '7341', '341', 'H', 'K', '7727', '4467', 'L']
[A]: 22905


[Q]: 3, 8, ['g', 'D', 'W', 'q', '7817', '9295', '2385', 'V', 'c', '7761']
[A]: 19497


[Q]: 11, 18, ['9199', 'Y', '2581', '4051', '9425', 'H', '2085', '2219', 'a', '921', 'p', 'L', '9097', '3971', '2721', 's', '9803', '3229', 'Q', 'a', 'x', '7071', '2805', 'D', '8123', 'v', 'i', 'Q', 'i']
[A]:
28821