import java.util.Scanner;


public class RSA {
    public static int min(int a, int b){
        return a<b ? a : b;
    }

    public static int countZeros(int [] arr){
        int counter = 0;
        for (int i : arr){
            while (arr[i] == 0)
                counter++;
        }
        return counter;
    }

    public static int countNums(int[] arr){
        int counter = 0;
        for (int i : arr){
            if (arr[i] == 1)
                counter ++;
        }
        return counter;
    }

     public static int maxLen(int[] arr1, int[] arr2){

        int zeros = min(countZeros(arr1),  countZeros(arr2));

        int nums = min(countNums(arr1), countNums(arr2));

        return zeros + nums;
    }

    public static void main(String[] args)
        {
            Scanner in = new Scanner(System.in);
            System.out.println("1 dl");
            int len1 = in.nextInt();

            System.out.println("2 dl");
            int len2 = in.nextInt();
            System.out.println("0 i 1 dla 1 tab");

            int[] arr1 = new int[len1];
            for (int i=0; i<len1; i++){
                arr1[i] = in.nextInt();
            }
            System.out.println("0 i 1 dla 2 tab");
            int[] arr2 = new int[len2];
            for (int i=0; i<len2; i++){
                arr2[i] = in.nextInt();
            }
            in.close();
            System.out.println(maxLen(arr1, arr2));
        }

}