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, 22, ['R', 'Q', '9117', '2883', 'h', 'E', '1747', 'l', 'U', 'k', 'W', '3365', '7093', 'a', 'm', '7509', 'm', 'a', 'j', 'S', '1023', 'M', 'Y', 'X', '5947', '7301', '2645', '9229']