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, 3, ['x', '971', '3029']
[EX A]: 4000

[EX Q]: 1, 6, ['H', '7937', '9919', 'G', 's', '1929', '8585', 'n', 'u', 'J', 'C', '387']
[EX A]: 19785

[EX Q]: 12, 20, ['M', 'C', 'a', '5315', '5965', '5447', '4699', '7471', '203', 'f', '1713', 'b', '6679', '6393', '9', '4953', 'K', '1753', 'h', '5321']
[EX A]:
25108