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: 10, 20, ['4857', 'v', '3419', 'F', 'd', '2951', '7703', '3525', '3811', 'n', 'l', '6155', '597', 'O', '9215', '7949', 'K', '4945', '8571', 'C', 'r', 'p', '701', '6955', '5329', '4277', '6975', '8375', 'L']

37432