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]: 3, 6, ['d', 'v', 'd', '5043', '8989', 'w', 'Y']
[EX A]: 14032

[EX Q]: 2, 15, ['r', '3527', 'Z', '9011', 'm', '879', '5305', '7153', 'c', '3567', 'd', '2319', 'M', 'y', '7703', '4899', 'G']
[EX A]: 39464

[EX Q]: 6, 6, ['7743', '7835', 'i', 'q', '1271', 'W', 'D', 'a', 'b', '6183']
[EX A]:
0