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.
13, 19, ['n', 'f', '7021', 'n', '3969', '8799', '9455', '6277', 'l', '6735', '8471', 'r', '8389', 'Z', 'w', 'V', 'Y', 'N', '5733', 'k', 'Q', 'C', '5059', '913', '3143', '5611', '9501', '7379', 'U']