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.
19, 19, ['2421', 'B', 'k', 'Q', 'm', '6093', '1691', '6245', '9429', 'Y', 's', '9067', 'b', '3935', '4381', 'k', '2439', '6429', 'B', '2335']