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, 7, ['S', 'a', '1011', '673', '7777', '8529', 'Y']
[EX A]: 0

[EX Q]: 6, 16, ['d', '8013', 'm', 'L', '3453', 'q', 'q', '7807', 'm', 'Y', 'E', 'j', '9765', '8621', 't', '1799', 'z', 'h', '8905', '8453', '7103']
[EX A]:
27992