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.

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']
60282

4, 10, ['B', 'b', '6741', '9121', 'N', '2871', 'Z', '1685', '995', '8681', '8591', 'z', '7423', '8661', 'R', 'b', 'g', 'Z', '5679', '4217', 'h', '8497', '3261', '6891', '2145', 'Y']
23353

4, 5, ['1197', 'F', '495', 'h', '6121', 'a', 'd', 'c', '4775', 'u', 's', 'x', 'C']

6121