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.
18, 21, ['4229', 'M', '6313', 'X', 'A', '2091', '3225', '207', 'L', '7969', '9573', 'o', 'P', '3091', 'c', '7537', 'G', '9035', 'z', '4435', 'J', '6095', '5145', '2849', '5735', '7659', 'O', '1045', '7187']