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.

[EX Q]: 3, 4, ['3949', '5315', 'G', 's', 'v', 'm', '7833', 'E', 'j']
[EX A]: 0

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

[EX Q]: 1, 10, ['9729', 'f', '345', 'I', '2159', '9783', 'G', 'g', 'H', 'r', '863', 'P', '245', 'N', '3639', 'T', '7081', 'E', 'Z', 'h', '9001', '8947']
[EX A]:
22016