you are given two arrays of integer a and b of the same length and an integer k$.$ we will be iterating through array a from legt to right and simultaeneously through b from right to legt and looking at the pairs x$,$ y where x is from a and y is from b$.$ such pair is called tiny if the concatenation is strictly less than k$.$ your task is to return the number of tiny pairs that you will encountrr during the simultaeneous iteration through a and b