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.

Input: Consider Input: 3, 6, ['7073', '3047', 'O', 'c', 'u', 'G']

Output: 0


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

Output: 9330


Input: Consider Input: 5, 7, ['P', 'j', '1045', '493', '8427', '7187', 'T', '6787']


Output: 15614