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.
6, 17, ['R', 'w', '9223', '2745', 'n', '2035', 'Q', 'e', 'd', '1137', '7349', 'v', 'S', '2715', 'Y', 'L', 'Y', 'R', 'o', '2869', '8585', '7855', 'g', 'E', 'G']