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.
1, 3, ['L', 'R', 'U', '2113', 'n', '661', 'n', '6235', 'l', '9631', '2079', 'm', 'i', 'W', '5995', 'n', 'R', 'G']