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, 10, ['N', 'p', 'z', '6083', 'x', 'x', '3063', 'Y', '7099', '9961', 'k', '7365', 'e', '8629', '9595', '2831', '3649', '3809', 'm']
[EX A]: 26206

[EX Q]: 2, 11, ['8237', '8149', '7077', '2199', '7839', 'c', 'j', 'Y', '845', '2273', 'n', 'Q']
[EX A]: 28382

[EX Q]: 6, 11, ['U', 'S', 'm', '2399', '6525', '9541', '963', 'A', '1199', '5129', '9563', 's']
[EX A]:
26395