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, 20, ['A', 'E', '4247', '9879', 's', 'X', '2485', 'e', '2361', '3605', 'Q', 'x', 'v', '1865', '5983', '6321', '7757', 'R', '563', '4591', 'F', 'n', '7817', 'D', '9219', 'G', 'N', '7051']