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.
8, 19, ['4357', 'Y', 'e', '4087', 'f', 'o', '1565', 'L', 'm', '9489', 'Y', 'z', 'l', '9049', 'r', '6393', 'z', '2691', 'm', 'g', 'h', '5031']