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: 1, 2, ['2085', 'z', 'F', 'd', 'q', '603', 's', 'e', 'b', '6579', '8987', 'X', '1853', '7533', 'c', 'c', '2559', '3227', 'u', '821', '7529', '2233', '867', '5421', '8675', '4653', '5071', '3295']
Output:
2085