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, 4, ['v', 't', '4357', '1303']
5660

6, 7, ['1595', '1523', '157', 'I', '3929', '6313', 'H', 'f', 'e', '93', '5625', 'b', 'J', 'b', '1185', '1505', 'I', 'y', '4043']
6313

7, 16, ['7453', '2741', 'g', 'i', 'c', 'R', 's', 'Y', '1991', 'B', 'P', '7955', '3777', 's', '9433', 'Q', 'U', 'W', 'r', '8735', '8917', '6547', 'N', 'w', 'T', '8427', 'l', 'w', '6837', 'i']

23156