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:
2, 2, ['8149', '7123', 'c', 'X', '1659']

Ex Output:
7123


Ex Input:
1, 4, ['7771', '6243', 's', 'n', '4775']

Ex Output:
14014


Ex Input:
3, 11, ['g', 't', '4627', 's', 'J', '9027', '6307', 'N', '291', '7789', '8815']

Ex Output:

36856