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.
8, 19, ['R', 'g', 'H', '9355', '9433', '8791', '8779', 'l', 'O', '6787', 'f', 'U', '2007', 'N', '5253', '5893', '3941', '7039', 'W', 't', 'e', 'm', '3871', 'M', 'W', 'J', '2763']