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.

6, 9, ['8047', 'Q', 'A', '2811', '8953', 'P', '4515', 'f', 'K', 'u', 'g', 'R', 'p', '667', '8703', '2903', '6299', '417', '3317', 'O', 'z', '3507', '8969', '6193', '2549']
4515

2, 7, ['3295', '2909', '8081', '8299', '8979', 'J', 'V', 'r', '2403', '5589', '6875', '9181', '6547', 'k', 'n']
28268

17, 22, ['X', 'o', '1443', '6689', '7645', 'p', '1095', 'Y', '6099', 'P', '53', '7399', 'M', '9425', '5905', 'W', '3277', '6103', '9221', '9601', '1997', '7863', 'Z', 'B', 'T']

38062