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.

8, 22, ['h', '2971', 'l', 'F', 'e', 'f', 'b', 'I', 'b', '4759', 'm', 'w', '6179', 'R', '2875', '3469', '3801', 'm', '6987', 'A', 'c', '6303', '8135', 'c']
34373

2, 8, ['4225', 'k', '4097', '4459', '8125', '431', '495', 'Z']
17607

2, 11, ['843', '1759', 'Z', '9083', '2669', 'O', '6109', '2511', 'A', 'H', '8321', '7675', 'b', '8075', '5809', '8947', '7709', 'G', 'T', '9149', '9491', '9089', '2507', 'd', 'm']

30452