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]: 5, 8, ['j', '1099', 'J', 'l', 'E', '6559', '6181', '4441']
[EX A]: 17181

[EX Q]: 7, 12, ['273', 'h', '2433', '7155', '731', '5459', 'q', 'G', 'i', 'l', '3981', 'W', 'V', '4999', '8191', 'K', '8393', '9255']
[EX A]: 3981

[EX Q]: 2, 3, ['f', 'C', 'f', 'V', 't', 'x']
[EX A]:
0