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.
20, 20, ['c', '1047', '2461', '2439', '8215', 'r', '7421', '7399', 'b', 'z', '415', '5259', 'h', 'n', 'F', 'F', '1465', 'I', 'N', '5979', '3233', 'T', '1503', '4043']