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, 11, ['1565', 'x', 'z', 'v', 'm', '9981', '751', 'z', 'z', 'J', 'R', '9461', 'k', '3241', '621', 'u', '3295', '8563', 'b', 'U', 'K', 'y', '8801', 'K', 'Q', 'h', '2123', 'O', '3113']

12297