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.

2, 2, ['8023', '9385', '7533', 'd', 'H', '3751', 'A', '1399']
9385

16, 17, ['Z', '8799', 'Z', 'P', '3413', 'X', '939', 's', 'G', 'x', '6911', 'v', '1183', '3507', 'r', 'C', 'k', 'Z', '4247']
0

4, 6, ['J', 'f', '7463', '6087', 't', '3629', 'Y', '6529', '2663', '7253', 'Q', 'z', 'Y']

9716