title: Partition array such that sum of all the subarrays should be divisible by K and the length of each subarray should be >=2 or <=4. Python will be great
body: <p>I got a question to solve to print the count of ways(and print all the subarrays) in which an array can be partitioned such that :-</p>
  <ol>
  <li>The sum of all the subarrays formed should be divisible by K</li>
  <li>The length of each subarray formed should be &gt;=2 or &lt;=4</li>
  </ol>
  <p>At last print the different subarrays possible, which follows the above 2 conditions, along with the count.</p>
  <p>The inputs are:-</p>
  <ol>
  <li>0&lt;=N&lt;=10^5</li>
  <li>0&lt;=A[0],A[1],A[2],...,A[N-1]&lt;=10^9</li>
  <li>1&lt;=K&lt;=10^9</li>
  </ol>
  <p>Ex :</p>
  <ol>
  <li>A=[6,3,3,8,4] -&gt; Given Array</li>
  <li>K=3 -&gt; The number by which sum of all the subarrays should get
  divided</li>
  </ol>
  <p>Possible subarrays according to the condition is 1 and that subarray is [[6,3],[3,8,4]] as length of all the subarrays are &gt;=2 or &lt;=4 and their sum is completely divisible by K(here K=3).</p>
  <p>**Solution in python will be helpful</p>