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, 2, ['5605', '6415']
[EX A]: 12020

[EX Q]: 11, 27, ['1573', '6065', '869', '77', '9665', 'o', '8359', 'g', '3557', '521', '6797', '5117', '3921', '5707', 'k', '9855', '8415', 'Y', 'l', 'S', '385', '9063', '8975', '2047', 'H', 'p', 'p']
[EX A]: 60282

[EX Q]: 7, 9, ['5227', 'X', '255', '705', 'T', '2193', '1231', 'D', 'k', 'B', '2597', '7309', '6093', 'D', 'h', 'D', '7883', 'l', '6371']
[EX A]:
1231