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]: 6, 18, ['6619', 'W', '8541', '1049', '3973', '6575', 'C', '4961', '2469', '3553', '6905', 'p', 'c', 'K', '2663', 'm', 'B', '4379', 'D', '6557', 'r', 'N', '4875', 'u', 'X', '3133', '6353', '1635']
[EX A]: 31505

[EX Q]: 1, 6, ['3309', 'w', '1143', 'D', 'Z', 'd']
[EX A]: 4452

[EX Q]: 5, 13, ['3415', 'l', '645', '2827', '3665', '6253', 'O', '2825', '7533', '3133', '9473', '4619', 'X', '9437', '3207', 'p', 'j', '5811', 'z', '959', 'M', 'O', 'a']
[EX A]:
37501