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, 11, ['W', 'c', '8889', '2649', '6183', '1489', 't', 'o', '4925', '4411', 'b', '5657', 'i', 'q', 'z', 't']
[EX A]: 28546

[EX Q]: 5, 6, ['2277', 'k', 'S', '6367', 'q', '5455']
[EX A]: 5455

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