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, 14, ['2863', '6961', '7205', '7333', '4181', '7219', '7153', '6541', 'k', 'x', 'k', '9693', '2403', 'O', '9515', '6823', '7189', '995']