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.
2, 22, ['9203', '8285', '3553', '8607', 'j', 'z', 'l', '755', '7119', '5781', '3159', '4171', '6675', '429', 'g', 'S', '2481', 'r', 'l', 'Y', 'N', '133', '4675', 'V', '8505', '2997', 'g']