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.
13, 20, ['2457', 'v', 'v', 'z', 'w', '1277', 'g', '467', 'G', 'A', '3329', '8305', '3889', 'F', '1103', 'y', 'h', 'G', '3345', '8291', 'T', '8463', '5889', '8579', 'D']