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.
20, 23, ['O', '5523', 'm', 'U', '1891', '1041', 'V', '7297', '3295', '895', 'B', '1493', 'p', 'j', 'O', 'd', '1377', 'R', 'i', '281', 'c', 'D', 'l']