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: 6, 7, ['1595', '1523', '157', 'I', '3929', '6313', 'H', 'f', 'e', '93', '5625', 'b', 'J', 'b', '1185', '1505', 'I', 'y', '4043']

A: 6313
****
Q: 2, 3, ['3335', '3451', 'f', 'M']

A: 3451
****
Q: 1, 10, ['8749', '6363', 'G', '4193', '6373', 'q', '4911', '19', 'X', 't', 'c', '9263', '3411', '5055', 'W', 'I', 'j', '1483', '9053', '4397', 'o', 'E', 'S', 'p', 't', '6321', 'v', 'W', 'i', 'A']

A:
30608
****