Definition: 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: 19, 25, ['4069', 'I', '8203', '9015', 'O', 'z', 'T', '3979', '4897', 'w', 'N', '8579', '8525', 'g', '13', 'x', 'k', '2773', 'i', 'L', 'o', 'a', '9997', 'Z', 's', 'D', '4059', '5155', '731']

9997