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.
2, 14, ['703', '7379', 'w', 'o', '1851', 'L', 'K', 'c', 't', 'j', '765', '1263', 'k', '7969', '4095', 'I', 'G', '2961', '4697', 'U', 'y', 'W', '1443', 'n', 'c', 'G', 'C']