public static void Merge1(int[] A, int p, int q, int r) 
	{
		int L = q - p +1 ;
		int R = r -q;
		
		int[] AL = new int[L+1];
		int[] AR = new int[R+1];
		
		for ( int i=0;i<L;i++)
		{
			AL[i] = A[p+i];
		}
		
		for ( int i=0;i<R;i++)
		{
			AR[i] = A[q+i+1];
		}
		
		AL[L]=Integer.MAX_VALUE;
		AR[R]=Integer.MAX_VALUE;
		
		int j=0,k=0;
		for(int i=p;i<=r;i++)
		{
			
			if(AL[j]<AR[k])
			{
				A[i]= AL[j];
				j++;
			}
			else if(AL[j]>AR[k])
			{
				A[i]=AR[k];
				k++;
			}
	
		}
		
		System.out.println("");
		
		for( int i : A)			
		{
			System.out.print(i+"#");
		}
		
		System.out.println("");
	}