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.
21, 26, ['h', 'L', '1411', '9699', '3073', 'u', '2551', '3595', 'k', 'R', 'k', 'l', '9149', 'B', 'y', 'Z', '8165', '921', 'n', '7987', 'D', 'C', '8897', 'd', '1133', '589', '5649', 'K', 'c', 'Q']