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.
12, 15, ['s', 'J', '2419', '3329', 'z', 'p', 'V', 'J', '3477', 't', 'L', 'r', '8983', '6035', 'M', '3697', '3675', 'o', '2103', '6837', 'm', 'E', 'R', 'S', 'c', '3011']