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.

3, 6, ['l', 'C', '6183', 'd', '6519', 'm']
12702

19, 21, ['y', '9403', 'C', '389', '5521', '9271', 'W', 'B', '3613', 'w', '2741', 'H', '8305', '727', '7641', '5857', '9183', '1297', 'p', '7371', 'b']
7371

1, 7, ['X', 'E', 'c', '2493', '9485', '6763', 'O', 'J', '937', 'N', '1971', 'k', 'm', '3093', 'e', 'W', '4977', '5097', '8627', '2323', 'H', 'D', '3099', '9365', 'S', 'O', 'E', '9095', '4359']

18741