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.
8, 23, ['4359', 'R', '5849', 'l', 'n', 'F', 'h', 'f', '9887', 'z', '7235', 'b', 'r', 'x', 'C', 'j', 'W', '7943', '3307', '7761', 'T', 'I', 'd', '1261', 'B']