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.

Q: 9, 13, ['2813', 's', 'z', 'G', '5927', '4415', 'T', 'c', '7029', 'e', 'o', 'd', '5913', 'y']

A: 12942
****
Q: 4, 6, ['c', 'I', 'O', 'q', 'W', 'w', '7245', '4329', '3833', 'v', 'p', 'V', '5311', 'x', '3971', 't', '8157', '1803']

A: 0
****
Q: 2, 22, ['q', '7065', 'w', '8247', 'D', '405', '6565', 'H', 's', '6683', 'W', '2103', 'b', '295', '6215', 'J', '7963', '1025', '161', '3183', '9979', '2501', 'o', 'a', '3629']

A:
62390
****