Simple PatternMatch Program in Java

import java.util.regex.*;
//import java.util.Scanner;
public class PatternMatch {
    public static void main(String args[]) {
      // Scanner sc=new Scanner(System.in);
     //  System.out.println("Enter the Pattern String");
    //   String ptr=sc.nextLine();
    //   System.out.println("Enter the Target String");
    //  String tar=sc.nextLine();
       int count=0;
       //Pattern p=Pattern.compile("[ab]");
      // Pattern p=Pattern.compile("[^ab]");
      // Pattern p=Pattern.compile("[a-z]");
     // Pattern p=Pattern.compile("[^a-z]");
    // Pattern p=Pattern.compile("[A-Z]");
       // Pattern p=Pattern.compile("[a-zA-Z0-9]");
        Pattern p=Pattern.compile("[^a-zA-Z0-9]");
        Matcher m=p.matcher("a7b@z#9");
        while(m.find())
        {
            count++;
            //int endData=m.end();
           // endData-=1;
            System.out.println(m.start()+"....."+m.group());
        }

        System.out.println("The total number of occurences is "+count);
    }
}