private int[] pomnoz(int[] p, int[] q) 
	  {
		  int len = p.length + q.length - 1;
		  int[] result = new int[len];
		  for (int i = 0; i < len; i++) 
		      result[i] = 0;
		  for (int i = 0; i < p.length; i++) 
		      for (int j = 0; j < q.length; j++)
		    	  result[i + j] = result[i + j]^p[i]*q[j];
		  return result;
	}