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, 6, ['7233', '7997', 'a', '727', '8387', 'Q', '1313', 'E']
[EX A]: 9114

[EX Q]: 10, 14, ['E', 'P', 'm', 'o', '4203', '657', 'Z', '9975', 'p', '4013', 'M', 'm', '7369', 'x', 'K', 's', '9411', '9787', '4293', '8229']
[EX A]: 11382

[EX Q]: 3, 13, ['N', 't', '2889', '7717', 't', 'o', '707', 'q', '5643', '1687', 'D', 'D', '4033']
[EX A]:
22676