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, 16, ['5707', 'i', '399', 'o', 'c', 'b', 'a', 'E', 'b', 'e', 'W', '8715', '31', '7771', 'a', '4805', '1475', '2795', '5693']