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.

2, 11, ['N', '3963', 'O', 'T', '8551', '3099', '577', '9273', '9849', '2593', '4693', 'A', 'O', '7381', 'o', 'P', 'g', 'H', '3927']
42598

3, 6, ['r', '8615', '4477', 'k', 'Z', 'B']
4477

13, 22, ['k', '7593', '5505', '2859', 'Y', 'E', '1059', 't', '9619', '995', '8889', '6259', 'f', 'P', '3833', 'L', '1223', 'V', '8193', 'y', 'E', '8925', 'h', 'n']

22174