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.
12, 16, ['9887', 'N', '7147', 'g', '1983', '3857', 'k', 'F', '95', 'j', 'a', '5901', '9207', '7261', 'T', 'i', '9797', '6021', 'H', 'C', '1111', 'U', '3695', '3561', 'U']