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.
2, 5, ['Q', '4343', 'o', '2071', '4459', '9179', '5513', 'U', '9367', '3303', '5273', 'i', 'e', 'I', 'w', '9351', 'J', 'n', '5785', 'O', '8877']