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, 21, ['o', 'k', 'W', 'U', '4663', 'H', '525', '3995', 'r', '9863', '3363', 'e', 'H', '4459', 'K', '2245', 'E', '5247', '4005', '6897', '653', 'x', '3439', '4343', '9589', 'h']