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]: 3, 14, ['Y', '9099', 'H', 'D', 'M', '1111', 'N', '4939', 'b', 'Y', '13', 'L', 'J', '4045', '2005', 'F', 'O', '1495', 'J', 'h', 'G']
[EX A]: 10108

[EX Q]: 5, 8, ['3017', '2471', 'r', 'M', '8213', '4259', '8397', 'A', '9809', '5827', '4079', 'v', '6735', 'T', 'n', '3877', '9777', '1395', '9631']
[EX A]: 20869

[EX Q]: 3, 6, ['665', '4843', '7171', 'x', '4981', 'f']
[EX A]:
12152