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.
10, 10, ['R', '2995', 'q', 'S', 'n', 'e', 'i', '9399', '4081', 'Y', 'l', 'U', '3903', 'g', 'C', 'X', '1103', 'Y', '3179', 'l', '9323', 'X', 'h', 'Q']