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.

1, 6, ['B', 'N', 'b', '9383', '4711', 'K']
14094

2, 10, ['2797', 'm', '439', '5677', '6719', '1587', 'I', 'I', 'w', '8483', '7341', '341', 'H', 'K', '7727', '4467', 'L']
22905

3, 18, ['h', 'x', '371', 'i', '8545', '7767', '5033', '1041', 'A', '4643', 'L', '187', '5017', 'x', 'R', '7891', '3919', '9721', '8625', '5817', 'D', '4825', 'S']

54135