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 Q]: 11, 18, ['7053', '4271', '3175', '3997', '4153', '3255', 'd', '4507', 'q', 'm', 'V', '9999', 'Q', 'v', '8543', '2835', '1545', '3549']
[EX A]: 26471

[EX Q]: 16, 17, ['Z', '8799', 'Z', 'P', '3413', 'X', '939', 's', 'G', 'x', '6911', 'v', '1183', '3507', 'r', 'C', 'k', 'Z', '4247']
[EX A]: 0

[EX Q]: 4, 20, ['C', 'd', '9211', '6285', 't', '4685', '7175', 'P', 'l', 'r', '6779', '5561', 'w', 'w', '2381', '8273', '4645', '3565', 'B', 'C', '663', '9513', 'e', 'o', '1109', 'q', 'k', '4951', 'Q']
[EX A]:
49349