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.

Ex Input:
1, 5, ['t', 'd', 'q', 'T', '1671', '3187', '7659', '8767', '1921', '8653', '5495', 'w', '2243', '5765', '9227', 'G', 'f', 'i', '6591', 'h', 'O', '4503', 'P', 'A', 'U', 'S', 't', 's', '6873']

Ex Output:
1671


Ex Input:
6, 7, ['6947', 'l', 'd', '6531', 'X', 'l', '9741', '6553', '9905', 'n', 'Q', 'Y', '2063']

Ex Output:
9741


Ex Input:
2, 5, ['9615', '7859', 'D', 'J', '1471']

Ex Output:

9330