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.
9, 21, ['z', 'N', '549', 'G', 'N', '6403', 'z', '8629', '9335', '7107', '1953', '5997', 'P', 's', 'K', 'P', 'q', '1635', 'k', '3743', 'U', '1791', 'X']