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.

9, 9, ['G', '9137', 'G', '2393', '9383', 'r', '6897', '547', 'W', 'h', 'p', '4557']
0

8, 14, ['i', '2929', '9353', 'T', '5451', 'n', 'y', '2861', 's', 'G', '7717', '3833', '3753', 'u', 'E', 'T', 'I']
18164

14, 20, ['u', 'O', '7349', 'l', 'z', 'o', 'D', '2299', 'v', 'i', 'B', 'D', 'T', 'Q', 'u', 'K', '5375', '5915', '2965', '5395', '5771', '8017', '6317', 'V', 'v', 'p', '183', 'A', '25']

19650