Minimum Digit Deletion

Description There are two integers N and K , where K is 2i i={0,1,2,3,...}. You are allowed to delete any number of digits from N. You can perform the deletion at most |N|-1 number of times. Your task is to find minimum number of deletions required such that resulting N is divisible by k or report -1 if it is impossible. Input Format First line of input contains T denoting number of test cases.