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: 5, 14, ['J', '7041', 'S', '5197', 'A', 'x', '8021', '7569', 'z', 'v', 'p', 'Q', 'g', 'q', 'K', 'o', '3149', '5513', '3615', 'O', 'L', '8593', '5509', '9815', 'i', '1799', '2579', 'Z', '3849', '1965']

15590