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.
6, 20, ['5779', 'T', 'n', '8483', 'Y', '3515', '1451', 'L', 'j', '3233', '5511', '4153', '1551', '8823', 'J', '8555', '9965', 'o', 'C', '447', 'E', 'O', '219', '2651']