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]: 6, 7, ['k', 'F', 'I', '1481', 'v', '5085', 'V', '9661', '525']
[EX A]: 5085

[EX Q]: 1, 3, ['b', '3997', '285', 'T']
[EX A]: 4282

[EX Q]: 7, 10, ['5521', 'F', 'A', 'm', 'J', 'l', 'r', '6035', 'b', '6269']
[EX A]:
12304