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, ['3309', 'w', '1143', 'D', 'Z', 'd']
[EX A]: 4452

[EX Q]: 3, 6, ['d', 'v', 'd', '5043', '8989', 'w', 'Y']
[EX A]: 14032

[EX Q]: 6, 15, ['R', 'W', 'V', 'a', '1417', '4257', 'a', '6101', 'q', '3429', 'h', '4119', 'K', 'h', 'R', 'L']
[EX A]:
17906