ALL ABOUT &

You are given an integer sequence $A_1, A_2, A_3, …, A_N.$ Consider an arbitrary $non-empty$ subset $S$ of the set $\{1,2,…,N\}$ of size $K$. Let's define the $value$ of such a set as  where $\&$ denotes the $BITWISE$ $AND$ $operator$. You need to print the $number$ of non-empty subsets of size $K$ with $maximum$ value and the $maximum$