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.
10, 12, ['c', '8151', 'R', '5397', '2899', 'h', 'O', 'i', '5993', 't', '5733', 's', 'l', '2841', 'd', '2117', '9087', 'i', 'a', 'U', 'H', '4943', '9501', '9987', '7747', '527', 'm', '7363']