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.
10, 20, ['6391', 'D', '1999', '5613', 'h', 'L', 'R', '3379', '9887', '1207', 'E', '3603', 'Y', 'u', '2177', 'k', '2005', 'P', '2379', 'b', '4787', 'J', '3413', 'R', '5255', 'B', 'S']