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.

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

Output: 32210


Input: Consider Input: 17, 17, ['I', 'd', '1961', '8361', 'B', '2463', '197', 'J', '4231', '543', '3629', 'm', '9433', '4359', '633', 'Y', '1339', 'e', '9633', '4531', 'G', '9021', 'k', 'V']

Output: 1339


Input: Consider Input: 1, 4, ['b', '9161', 'w', 't', 'G', '4985']


Output: 9161