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, 2, ['j', '3613']
[EX A]: 3613

[EX Q]: 5, 11, ['9535', 'L', '5957', 'm', 'B', 'W', '2105', '4959', 'f', '395', 'a', 'W', 'C']
[EX A]: 7459

[EX Q]: 21, 26, ['z', 'U', '7853', 'p', '9601', '1301', 'Z', '7291', '527', '711', '5641', 'M', '1179', '5131', 'x', 'V', 'v', '2401', '8475', '3511', '2775', 'A', '3561', '9837', '855', '5637', 'i', '2149']
[EX A]:
22665