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, 20, ['l', 'v', '9875', '4401', 'r', '3539', '5539', '1313', 'B', '5849', 'z', '7823', 'r', 'i', '9919', '575', 'O', '4937', '6839', '4215', 'U', '1901', 'r']