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, 6, ['5473', '3405', 'o', 'o', '2917', '6121', 'p', '3985', 'g', '9279', 'j', '8079', 'E', '9549', '549', '8419', '7261', '2073', '3985', '7033', '1385']