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.
17, 29, ['Z', '5367', '37', '1439', 'g', 'P', 'W', 'X', 'J', '553', '3017', 'D', '7779', '2683', '4727', '1661', 'w', '3807', 'K', 'Z', '233', 'Q', '3381', 'c', 'A', 'y', '6619', 'N', '6321', 'y']