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, 12, ['T', '8653', 'u', '7665', 'o', '8885', '3045', '4323', '9979', '965', 'W', 'y', 'X', 's', '7401', 'R', 'r', '5147', '5259', '9149', 'l', '7073']