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, 15, ['8815', 'w', '5613', 'm', '9515', '9741', 'O', 'U', '7197', '5237', 'M', '9899', '8289', 'l', '3', '9313', '4467', 'K', 'k', '637']
55494

4, 4, ['2107', 'l', '7551', '4907']
4907

6, 18, ['o', '4547', 'l', 'p', 'D', 'H', '7241', 'M', '7243', 'j', 'f', 't', 'T', 'L', 'c', '8733', '2613', 'A', '1741', '1731', '39', 'W', 't', 'l', '4007', '79']

25830