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.

5, 15, ['5049', '2581', '4617', 'b', 'c', 'z', '8247', 'd', '1413', '7797', 'K', 'T', '9009', 'V', '5179', '1643', '3923', '4885', 'j', '6717', 'D', 'D', 'O', '5777', 'W', 'J', '6267', 'e']
31645

2, 7, ['7349', 'P', 'i', 'I', 'e', 'f', '9829']
9829

19, 21, ['m', 'L', 'c', '1307', '2697', '4741', 's', 'g', '543', '7445', 'P', 'R', 'P', 'n', 'e', 'V', 'A', 'L', '7239', '5899', 'A', '2779', 'g', '4309', '4737', 'L', '2389']

13138