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, ['3211', 'g', '1815', '2615', 'Z', 'y', '2281', '713', '8299', 'Y', 'Z', 'z', 'p', '2797', '9927', 'i', 'M', 'E', '9179', 'U', '3461', '7039', '85', '6205', '6299', 'Q']