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.
11, 23, ['2435', 'D', '2441', 'n', 'B', '3837', '7137', 'N', 'D', '4531', '7881', '5315', '8373', 'D', 'C', 'q', 'I', 'Z', '7761', '9051', '19', '1075', '1925', '143', '473', 'J', 'h']