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, 16, ['7509', 'R', 'a', 'V', '6365', '9597', 'y', '6295', 'M', 'X', 'K', 'O', '1577', 'u', 'D', '6835', '4783', '5355', 'B', 'g', 't', 'm', '7205', '979', '4465', 'C', '6921']