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, ['B', 'N', 'b', '9383', '4711', 'K']
[EX A]: 14094

[EX Q]: 7, 18, ['279', 'o', '8421', 'e', '2167', '6647', 'i', 's', 'I', 'G', '8201', 'E', 'h', 'U', '403', 'c', 'u', 'B', '9415', 't', 'a', '8787', 'E', '9677']
[EX A]: 8604

[EX Q]: 2, 13, ['5327', '3713', 'i', 'o', 'a', 'L', 'u', '7799', '9929', 'y', '2247', '8401', 'r', '285', '2375']
[EX A]:
32089