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]: 2, 10, ['2797', 'm', '439', '5677', '6719', '1587', 'I', 'I', 'w', '8483', '7341', '341', 'H', 'K', '7727', '4467', 'L']
[EX A]: 22905

[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]: 19, 22, ['7459', '8631', 'E', 'A', '9165', 'U', 'f', '6343', 'X', 'w', 'l', 'c', '9667', 'Q', '1179', '3915', 'H', '5067', 'L', 's', 'D', '2757', 'n', '6655', '6939', '2403', 'c']
[EX A]:
2757