PAL4_25-11

package pal;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;

public class Main {

    static public int countBelts; // belts are labeled 0:countBelts-1
    static public int countSegment; //labeled by chars a-z, Segment in 1 disk
    static public int countDisk; // count disks in one belt
    static public String[] belts;
    static public String[] beltsGroups;
    static public ArrayList<String> beltsUnique;
    static public ArrayList<String> disks;
    static public int countGroups;
    static public int[] numOutput;
    static public String[] strOutput;
    public static void main(String[] args) throws IOException {

        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String[] in = br.readLine().split(" ");
        countBelts = Integer.parseInt(in[0]);
        countSegment = Integer.parseInt(in[1]);
        countDisk = Integer.parseInt(in[2]);
        belts = new String[countBelts];
        beltsUnique = new ArrayList<>();
        disks = new ArrayList<>();
        beltsGroups = new String[countBelts];
        numOutput = new int[countBelts];
        countGroups = -1;
        String belt, group;

        for (int i = 0; i < countBelts; i++) {
            in = br.readLine().split(" ");
            belt = createBeltofDiskIndex(in);
            belts[i] = belt;
            belt = createBeltGroupsOfBeltIndex(belts[i], i);
        }
/*
        for (int i = 0; i < countBelts; i++) {
            belt = createBeltGroupsOfBeltIndex(belts[i], i);
        }*/

       strOutput = new String[countGroups+1];

        countingSort();
        System.out.println(countGroups+1);
         for (int i = countGroups; i >= 0; i--) {
             System.out.println(strOutput[i]);
        }


    }

    public static String createBeltofDiskIndex(String[] strArr) {
        Integer indexOfSegment;
        String disk;
        String belt = "";
        for (int j = 1; j <= countDisk; j++) {
            disk = strArr[j];
            //   System.out.println("disk " +disk);
            indexOfSegment = indexOfexistingDisk(disk);
             if(indexOfSegment == -1)  //vzor neexistuje, pridame ho do listu a vratime si jeho index
            {
                disks.add(disk + disk);
                indexOfSegment = disks.indexOf(disk + disk);
                belt += indexOfSegment.toString() + " ";
            }
            else { //vzor jiz existuje
                belt += indexOfSegment.toString() + " ";
            }
        }
        return belt;
    }

    public static String createBeltGroupsOfBeltIndex(String belt, int numberOfBelt) {
        Integer indexOfSegment;
        String beltUniq = "";
        indexOfSegment = indexOfexistingBelt(belt);
        if (indexOfSegment >= 0) { //pasek jiz existuje
            beltsGroups[indexOfSegment] = beltsGroups[indexOfSegment] + " " + numberOfBelt;
            numOutput[indexOfSegment]++;
 //           System.out.println(numOutput[countGroups] + " - " + beltsGroups[indexOfSegment][0]);
        } else //vzor pasku neexistuje, pridame ho do listu a vratime si jeho index
        {
            beltsUnique.add(belt + belt);
            countGroups++;
            beltsGroups[countGroups] = Integer.toString(numberOfBelt);
            numOutput[countGroups]++;
//            System.out.println(numOutput[countGroups] + " - " + beltsGroups[countGroups][0]);

        }
        return beltUniq;
    }

    public static int indexOfexistingDisk(String disk) {
        if (disks.isEmpty()) {
            return -1;
        } else {
            for (String s : disks) {
                if (checkRotation(s, disk) || checkRotation(s, flip(disk))) {
                    return disks.indexOf(s);
                }
            }
        }
        return -1;
    }

    public static int indexOfexistingBelt(String belt) {
        if (beltsUnique.isEmpty()) {
            return -1;
        } else {
            for (String s : beltsUnique) {
                if (checkRotation(s, belt) || checkRotation(s, flip(belt))) {
                    return beltsUnique.indexOf(s);
                }
            }
        }
        return -1;
    }

    public static boolean checkRotation(String s1, String s2) {
        //vrati true, kdyz string1 obsahuje string 2
        if ((s1.length() == 2 * s2.length()) && (s1.contains(s2))) {
            return true;
        } else {
            return false;
        }
    }

    //zrcadleni
    public static String flip(String s1) {
        StringBuilder str = new StringBuilder(s1);
        return str.reverse().toString();
    }

    public static void countingSort() {
        int[] sortedArray = new int[countGroups+1];
        int min = numOutput[0];
        int max = numOutput[0];
        //find min and max values for histogram from current column
        for (int i = 1; i < countGroups+1; i++) {


            if ( numOutput[i] < min) {
                min =  numOutput[i];
            } else if ( numOutput[i] > max) {
                max =  numOutput[i];
            }
        }
        //histogram length from min to max
        int[] hist = new int[max - min + 1];
        for (int i = 0; i < countGroups+1; i++) {
            hist[numOutput[i] - min]++;
        }
        //pole vyskytu
        hist[0]--;
        for (int i = 1; i < hist.length; i++) {
            hist[i] = hist[i] + hist[i - 1];
        }
        //min to max
        for (int i = 0 ; i <= countGroups; i++) {
            int histIndex =  numOutput[i] - min;
            int index = hist[histIndex];
            sortedArray[index] =  numOutput[i];
            strOutput[index] = beltsGroups[i];
            hist[histIndex]--;
        }
    }
}