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, ['u', 'L', 'm', '9283', 'e', '4615', '7815', '7185', 'h', 'h', '8985', '3987', '1521', 'k', '5715', 'd', 'w', 'T']
[EX A]: 13898

[EX Q]: 8, 9, ['6753', 'Y', 'v', '1365', '1033', 'l', 'A', '203', 'J', '8391', 'i', '1813', 'V', 'D', 'S', '4981', 'o']
[EX A]: 203

[EX Q]: 9, 10, ['T', '9825', '3449', '1733', 'E', 'Z', 's', '101', '3657', '6333', 'J', '211', 'I']
[EX A]:
9990