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.
14, 21, ['2315', '1941', '6229', '7535', 'F', 'U', '6729', '8353', 'f', 'h', '3697', 'm', 'A', 'd', '7901', '1615', 'l', '2875', 'C', 'l', '6743', '5535']