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.

1, 2, ['7321', '6233']
13554

11, 12, ['S', 'f', 'V', '7983', 'O', 'k', '699', '2831', 'C', 'B', 'B', '1263', 'b', '509', '8963', '8895']
1263

8, 20, ['6439', 'S', 'j', '8681', '8907', '2197', 'j', '9819', 'z', 't', 'T', '6697', 'O', 'W', '5097', 'A', '1561', 'F', 'V', '8815']

31989