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, 19, ['6769', 'D', '2779', 'L', '7943', '955', 'l', 'g', '3677', '881', 'n', 'I', 'E', 'F', 'R', 'w', 'h', '6853', 'M', 'j', 'D', 'T', '3041', '5139', '1019', 'h', 'J', 'K']