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.
7, 18, ['2737', '4679', 'X', 'A', 'I', '8809', '893', 't', 'S', '4549', 'C', '7721', 'd', 'c', 'y', 's', '2789', '8283', '1169', 'R', '8839', 'Z', '2505', '7785', 'M', 'U', 'o', 'G', '183']