Merging two sorted arrays

import java.util.Scanner;
class Merge
{
void toMerge(int arr1[],int arr2[])
{
int arr3[]=new int[arr1.length+arr2.length];
int i=0,j=0,k=0;
while(i<arr1.length&&j<arr2.length)
{
if(arr1[i]<arr2[j])
{
arr3[k]=arr1[i];
k++;
i++;
}
else
{
arr3[k]=arr2[j];
k++;
j++;
}
}
for(int m=j;m<arr2.length;m++,k++)
arr3[k]=arr2[m];
for(int m=i;m<arr1.length;m++,k++)
arr3[k]=arr1[m];
for(int t=0;t<k;t++)
System.out.print(arr3[t]+"\t");
}
}
class MergeTest
{
public static void main(String args[])
{
Merge m1=new Merge();
Scanner sc=new Scanner(System.in);
System.out.println("Enter the value of n:");
int n=sc.nextInt();
System.out.println("Enter the value of m:");
int m=sc.nextInt();
int arr1[]=new int[n];
int arr2[]=new int[m];
System.out.println("Enter the elements of first array in sorted order:");
for(int i=0;i<n;i++)
arr1[i]=sc.nextInt();
System.out.println("Enter the elements of second array in sorted order:");
for(int i=0;i<m;i++)
arr2[i]=sc.nextInt();
m1.toMerge(arr1,arr2);
}
}