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: 16, 16, ['V', '9929', 'S', 'g', '1751', 'd', 'G', 't', '9289', '6139', 'J', 'T', 'W', '8085', '7747', 'j', '5657', '8875']

A: 0
****
Q: 7, 19, ['6719', 'c', 'S', '3259', '1287', 'u', '9251', '2183', '4821', '9449', 'I', 'P', 'i', '7597', '8141', 'G', 'j', '8587', '7245', 'G', 'O', 'o', '9479']

A: 57274
****
Q: 1, 2, ['7411', 'f', '7457']

A:
7411
****