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]: 3, 7, ['1811', 'Z', 'C', 'x', '6171', 'W', 'N', 'L', 'h', '4497']
[A]: 6171


[Q]: 10, 16, ['V', 'b', '2575', '385', 'U', 'I', 'Y', '2647', 'V', 'k', '6379', 'W', '1883', 'n', 'K', '3001', '6791', 'I', '4285', 'f', 'i']
[A]: 11263


[Q]: 4, 9, ['2759', '8631', 'j', 'q', '7537', '2787', '6059', '593', 'B']
[A]:
16976