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 Input:
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']

Ex Output:
32210


Ex Input:
6, 9, ['J', '5177', 'm', '7413', 'T', 'N', '5153', 'S', '8145']

Ex Output:
13298


Ex Input:
2, 5, ['4311', 'E', 'q', '123', 'K', 'N', '7531', 'x', 'h', 'H', '9919', '705', '3025']

Ex Output:

123