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.

5, 12, ['1699', '6521', '1705', '8871', 'C', '8963', '8657', 'E', '2693', 'e', 'S', 'a', 'M', '289', '6037', '2663', 'w', 'e', 'X', '2973', 'j', 'f', '1609', '2759', 'P', 'l', 'k', '4463']
20313

3, 18, ['5593', '9147', 'F', 'O', '3355', '4669', 'j', '8117', 'I', '6935', 'x', 'Z', 'q', '8919', 'F', 'j', 'z', '215', '1761', 'y', '9889', '5557', 'p', 'm', '9293', '4673', 'X', '9519', '6099']
32210

2, 2, ['2223', '3409', '5269', '9865', 'M']

3409