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, 9, ['g', 'R', '6039', 'T', '4905', '8437', 'a', '3039', 'Z', 'P', 'O', '4249', 'W', '8933', 'h', 'w', '9001', '4459', 'W', '8713', '9369', '6397', '7693']