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.
19, 22, ['459', 'p', '3243', 'S', 'T', '1809', 'v', 'x', '9379', '7103', '2881', 'W', '4295', 'N', '1425', 'm', 'C', '937', '8045', 'D', 'G', '7973', 'x', 'v', 'f', 'h', '95', '4411', '345']