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.
6, 8, ['8929', '855', '3109', 'K', '1999', 'b', '1745', '1785', '4159', '4509', 'j', '6293', '8951', '2735', '2749', '6273', 'C', '6251', 'F', 'n']