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]: 9, 10, ['8997', 'P', '2065', 'F', '2531', 'o', 'a', '3057', '7393', '2665', '4563']
[EX A]: 10058

[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]: 5, 18, ['y', 'f', 's', '9541', '4833', '7261', 'n', '7335', '8763', 'J', 'O', '3', '7399', '4269', 'O', 'h', 'Z', '1941', 'F', '2757', '7173', 'T']
[EX A]:
41804