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, 1, ['5141', 'S']
[EX A]: 5141

[EX Q]: 6, 10, ['5601', '3783', '7919', '9195', 'G', 'J', 'L', 'X', 'O', 'F', '2479', 's', 'H', '5353', '7079', '2199', '2937', 'S']
[EX A]: 0

[EX Q]: 11, 16, ['J', 'A', '243', '9829', '6289', 'L', '2573', 'M', '3939', 'U', '65', 'h', '7297', '2413', 'F', 'B', '1369', '2241', 's', '9005', '1893', 'J']
[EX A]:
9775