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.
11, 21, ['T', 'j', '3259', '1625', 's', '3561', '435', 'k', '2243', '7307', '8523', 'L', 'F', '6809', 'F', '8225', '5721', 'b', '6879', 'Y', '6815', '5853']