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.
11, 22, ['Y', '1871', 'N', 'z', '2099', 'c', 'U', 'T', 'Y', 't', '1453', 'L', '675', '803', 'K', '7677', '5289', 'q', 'L', 'b', 'E', '2837', '6761', '4265', '2477']