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.
15, 17, ['2647', '4601', 'U', 'O', '9945', '6063', '5707', '2277', '2179', '3027', '7471', 'U', '7775', '7911', '3061', 'B', 'e', 'j', 'L', '4481', 'P', '1503', '2011', 'U']