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, 19, ['4723', 'r', 'b', 'I', '7639', 'x', 'j', '1697', '8525', '4083', 'i', '1337', 'Q', '3705', '4229', 'L', '3721', 'g', '2569', 'j', '447', '2421', '9513', 'p', '6663']
37505

1, 7, ['173', '5875', 'C', '7417', '3565', '1949', '537', '7707', 'o', 'y']
19516

26, 28, ['m', 'U', 'v', '8729', 'w', 'u', 'h', 'u', 'p', '8367', 'I', '4405', 'd', '8895', 'G', 'M', '4433', 'P', 'q', 'x', 'y', '7947', '1713', '4591', '5027', 'd', '517', 'c']

517