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]: 1, 6, ['1529', '2989', 'T', '8059', 'f', 'j', 'x', '2209']
[EX A]: 12577

[EX Q]: 4, 4, ['t', 'Z', '8689', 'I', '5589', 'H', 'Z']
[EX A]: 0

[EX Q]: 9, 10, ['S', 'r', '7219', '4489', 'o', 'Z', '5427', '8879', 'K', '1233', 'L', 'i', '8805']
[EX A]:
1233