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.
12, 13, ['7105', '4307', '7097', '7557', 'b', 'l', '6555', 'M', 'P', 'x', 'P', '9507', 'N', 'j', '5787', '859', 'C', '8443', '4907']