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, 6, ['H', '7937', '9919', 'G', 's', '1929', '8585', 'n', 'u', 'J', 'C', '387']
[EX A]: 19785

[EX Q]: 1, 2, ['X', '6095', '5959', '4481', '5997', '3307', 'B']
[EX A]: 6095

[EX Q]: 7, 21, ['U', '7385', '2327', '5549', 'E', 'D', '9691', 'L', '2181', 'o', '1579', '1057', '1137', 'E', 'c', '1617', '4255', 'J', '4683', 'F', 'C']
[EX A]:
26200