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, 21, ['5745', '1389', 'Y', '7995', '1123', 'c', '4531', 'C', 'C', 'S', '7079', 'F', 'H', 'k', 'w', 'Y', '7837', '4985', '4593', '819', '625', '4057', 'I', '6091', 'l', 'V']