Definition: 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.
Input: 13, 19, ['I', '919', '4609', '2053', '4003', '7237', '221', 'N', 'l', 'C', 'G', 'l', 'z', 'X', '8651', 'D', '7179', '4045', '1875']

21750