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]: 2, 10, ['N', 'K', '4585', 'd', '8219', '3831', 'e', '7037', 'h', 'd', 'c', '577', 'c', '3559', '4059', 'M', '5349', 'V', 'L', '1807']
[EX A]: 23672

[EX Q]: 1, 5, ['E', '8579', '229', 'X', '1579', 'C', '5091']
[EX A]: 10387

[EX Q]: 6, 14, ['R', 'O', '5027', 'b', '8011', '5153', 'p', 'w', '3677', 'E', 'P', 'i', '8617', '5415', 'W', 'q', 'V', 'p', 'a', '2607', '1779']
[EX A]:
22862