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.
1, 14, ['a', 'j', '1299', 'T', '937', 'n', 'L', 'F', 'U', 'F', 'W', 'F', '7241', 't', 'Z', '2901', 'D', 'K', '3705', 'M', 'Z', '4325', 'G', '3789', 'w', 'S', '4671']