private int[] dodaj(int[] p, int[] q) 
	{
		int len = Math.max(p.length, q.length);
	    int[] result = new int[len];
	    for (int i = 0; i < len; i++) 
	    {
	      if (i < p.length && i < q.length) 
	    	  result[len-i-1] = dodaj(p[p.length-i-1], q[q.length-i-1]);
	      else if (i < p.length) 
	    	  result[len-i-1] = p[p.length-i-1];
	      else 
	    	  result[len-i-1] = q[q.length-i-1];
	    }
	    return result;
	 }