// cf bits/extc++.h nonsense
#ifdef ONLINE_JUDGE
#define _EXT_CODECVT_SPECIALIZATIONS_H 1
#define _EXT_ENC_FILEBUF_H 1
#endif
#include "bits/extc++.h"

using namespace std;

template <typename T, typename... U>
void dbgh(const T& t, const U&... u) {
    cerr << t;
    ((cerr << " | " << u), ...);
    cerr << endl;
}

#ifdef DEBUG
#define dbg(...)                                              \
    cerr << "L" << __LINE__ << " [" << #__VA_ARGS__ << "]: "; \
    dbgh(__VA_ARGS__)
#else
#define dbg(...)
#define cerr   \
    if (false) \
    cerr
#endif

using ll = long long;

#define endl "\n"
#define long int64_t
#define sz(x) int(std::size(x))

inline void init_io() {
    cin.tie(nullptr);
    cin.exceptions(ios::failbit);
    ios_base::sync_with_stdio(false);
}

template <typename T>
ostream& operator<<(ostream& out, const vector<T>& arr) {
    out << "[";
    for (int i = 0; i < sz(arr); i++) {
        if (i) {
            out << ", ";
        }
        out << arr[i];
    }
    return out << "]";
}

template <typename T>
struct PSA {
    int n;
    vector<T> psum;

    template <typename U>
    PSA(const vector<U>& arr) : n(sz(arr)), psum(n + 1) {
        for (int i = 0; i < n; i++) {
            psum[i + 1] = psum[i] + arr[i];
        }
    }

    T query(int l, int r) const {
        return psum[r] - psum[l];
    }
};

template <typename T>
bool on(T mask, int bit) {
    return (mask >> bit) & 1;
}

template <typename T>
vector<T> iota(int n, T x) {
    vector<T> arr(n);
    iota(begin(arr), end(arr), x);
    return arr;
}

string to_base_64(vector<bool> bits) {
    while (sz(bits) % 6) {
        bits.push_back(false);
    }

    string ans;
    for (int ql = 0; ql < sz(bits); ql += 6) {
        int cv = 0;
        for (int i = 0; i < 6; i++) {
            cv |= bits[ql + i] << i;
        }
        ans += char(' ' + cv);
    }

    return ans;
}

vector<bool> from_base_64(string s) {
    vector<bool> ans;

    for (auto& c : s) {
        int cv = c - ' ';
        for (int i = 0; i < 6; i++) {
            ans.push_back(on(cv, i));
        }
    }

    return ans;
}

vector<bool> to_bits(const vector<int>& arr) {
    vector<bool> ans;

    for (auto& a : arr) {
        for (int i = 0; i < 30; i++) {
            ans.push_back(on(a, i));
        }
    }

    return ans;
}

vector<int> from_bits(const vector<bool>& arr) {
    vector<int> ans;

    for (int ql = 0; ql < sz(arr); ql += 30) {
        int cx = 0;
        for (int i = 0; i < 30; i++) {
            cx |= arr[ql + i] << i;
        }
        ans.push_back(cx);
    }

    return ans;
}


void send(vector<int>);
vector<int> wait();

void verify(const vector<int>& arr) {
    int n = sz(arr);
    assert(n == 1000);

    set<int> cx;
    for (int i = 0; i < n; i++) {
        for (int j = i; j < n; j++) {
            int cv = arr[i] | arr[j];
            assert(!cx.count(cv));
            cx.insert(cv);
        }
    }
}

constexpr int n = 1000, m = 27;
vector<int> c_data;

void gen_data() {
    string cs =
        R"14121412( "$W$*82(!4(0Z $!A%#2D2!"%3$A "D$7 4F0 %H5"8 0&4D"&APH "()<"4@*F @&PF $.88 0#Q8  F9!$9: @!PF@ #C  ,'(HD< 0T0&!@0Q%",0$G (+6 !*P1 &#B P&P"2,$41B0""-I$ : $S &(13 !$;$!%H9 $(6H* *55  0'!A! 4DL"8$,8$(V 9 0*L1 @9A($<($+  \< !1%11 (CF "((E8$#.@0$1K H #!70 4M!! A@&0%T T0!1 @? C#$H $( R' H(J#!G((!$F@I % 2B%&)"0& 3<* C$"B"(4)(#"P6# &$1#"PAJ $"$HB%- D,$ .$)&% )Z B$)T ,8# &!*Q$$."(2$"Q(P!6%"$$2"<& $$&0'CH B"2$*H"@1$A&B!H 'Q@0(%,60$!!6X@ ,*H0"94(% &'1@ ,:"& 0U(@!) J$% &48#."!6 ,R A$@"6+ 44 1#, E,!B$P2"34@, &!D8!,A0"#&3 1$JD &"&,AB X6$( .((P"$(T&"010&#:9!! 0>!"!A*,& 6D'  ;!0) H31 " F"3"V0 H"2 KP  (BZ$JD,0 Q F0"+ !L! P&; 5"(H",$C1 *- - (DAH"@D$N %@25 0@)-!A#HA 6H B"G@#@ !<(6 "9#!$$@2:"$ @N%$0T*" @AG"* -0#!!\1 I) A!!D,%!89@0!$",+!0*<@$ 51(%"3M  " #3&#(@C!P7! ":@ :" ('F$&F &"48L@ @&8%$F, Q )$B8!$"S"!%N$ "$95 $-! 9" 2,J$"&D,! +P8"$I$8"C B,!!5'$ H$A!&@:.0 028"#0AG !A9#0 48"&"A- + 88D@!C%8 !,M 4 4'& "$*AA$%D4 %:()($9 P%!$J8 %0 3A&F$R !@@N($@P89 P1D& ( M%"$;!* @P()%Y!! #H1:$ J@!!% 7""#%8$0#0$+5 $$+*$:!$"&) H8&"(%*%"="$!(QH8 D"21"09P("L)#$ $ E2%8FH$ &D80$%10: $I8D )D Z )#@@&80IB )C@2 1Q)0 H!(> 400*%HH"L A E@#V*( !BA+ !(44<  NA1  P(V!!H&E "P*%"!&(<"("!<&B@@.! TB5 8LA $,B*# $ 2V$6"P4 &*&"$$)BD$110C *D0#$@@8Q!:T @"4B"!#@)AC ! %Y"T$$A"#P' "X  \$%#@%! /@3 2(#0% \0A$(X&$$,J @&0H<4 @0DR"0(XI (U ,$ B.4!$#C) < !9$* P'!B'!, !U4$ * D*#XX!" C(&4 AD$@&Z F@ H*$@#!B/ $3 @Q$ "P\$9!".  A +'2,"#$$&-$"S *@$&U$" C!J0 "E) %-H"8 P(*!&1@E* 10$,% !'!'H)"J $I@!%@0H9"+ #Q (1"7 -1,0 0BBJ 8P"#!J5 !"R(8""CR0@ 8H&P  '&,$I#!"$61 R  $(;#'& @#))<( @6)!!D"A8$2($<$*$: #H#G  1:@$$$" >#@:1& H 1G  9:(!!A<B XH(0"0!8C"E"$P$F K" H(K! @,B4!<XD  5$"A$-42( SH"! 5( '!H/ 0$@,(##X!)) 2Z0$ HC (% K&$!P /& $)0I"$ +D#"*I(!Z 0J 0@%B%!# R#C$PA #%!A$%A(!&&66  ="R  N$@% 0!*I$EP%! D,0. ).02  E$<!K"8( + ,F ^  "# !%6##8D4  5H0#Y 8# "(BP# (8G$P0%(#*(P$&@ 7P"4)( ' $\4"A&)B  5D(% ,'#"9I 0$P!4%$&0&)$0"X$&#PB@$C0!< 2 I*"4$!&#!2BI  3 '&'%C  4$X$!AE %$ (L-!'0(&$BI2 ",1(,"B8$1$(2\@ $4$%%A"(1%1 (&'"D A'H4%"$&#82 P"@R$ ,DU : 1A!"0JT ((*3$O $$!I0M  '$*P %%1& @A@8#A(0T" Q42!($2## (5#&E@(%$5(0H$ J%- D)D% 4P!: ()&4""0&.!"F+$  PQH$@6*H 0($:#JJ * !02'!(*)A!'@H"!10!3"R0)A 8:&! "* E#"&4#!# \ %$; @% Y#D  8E!%)"*!#(B%"#&(8,$ %2-"'" 0'@.&(!BUP  2! U!*4"1!Q#0"!HS 0! 2"F%B!90$" /1$1*PB $2J@!0A28!,!3B TB9  0#+# 84!X @",R!"BD%"(48"%0Q 5"(5R " %K($*!2P"P@0L!E80B ""0S""48D$"-$H$&"=! )?  "3!H(!,(A#"DH(H$ %8L!022E  )T!#&#A %1C"4 ),8!"22** !&!'$I$C( J(A"!0VF  L410 (%!2%(@49"P,4* E0A2 69 (!R@B$"F8 D$'90@ 1H,"$:""D!B ,E"*'@ #7B(! Y@*$ (1!M @X,$"!A04&1()- R(!D!!D8,"H!4#!F4"4 &P$1!,D4@"D%"2"#!)1!D-0 %8800&'@1"!< 8D"P"J$! 83+  (RJ!20P '+8$""!,1D!5!L $(**- &A+( #3 T $X ('DS" $"*E0""V(0"@*P!%S0A $@<H% "GB" $ B] #BP* -(40$%<B !#' 1"(&J@$$$$M$(%@+!D:P0 6 L"$40I &  Q>!A *-!:$$&! 2*P&1- @&0$FD$%@XP  42F"L("P$T@"3 !!3P!. 0D%!(18# ++ &4!#,!!(:*" *)2#K1 (!5B@"$ 2QR )1 D#D$@X"!8!4&-B($"(09Q T 2A!"AD(&4,$1$*(V! <8(2 2E$D L ,$&#X!H S)%  0"1+";P00 ,14H !DB!%10-@!(@('&("'"%"D"Y 4DB"!,$%P"!)HD"!+2($&H!%!+F0 "04#P"!!9' 4> ) DB&D = A4 -$@B"B!!H#3 &1!&T ,!C1" &!%%: H& "'B(22!!P4)!'!&% J0@6 @*(I"L )B$<"-" H!AD!PT:  0B 9&D* &%8#%0!2)!B$@'0(&E!1(")1)!$!,H2!9AX  $0>A  R1!#A,40!0*$T!"H. #%) 8%! 7%$ B%A&F6 B 7(@ #I"B0$L$-( ,$#D$ RH- !+"#"5!"@#)B$*$220)$H"T, &"2H!! .H%5$P0$ PM"!8 BQ"H.D! 04J(!!(AH&% X*$&H +$&IL   &:R H( 5&! /L  H+(% 074!(4@'"8!= "0AT"$A(#&! )N* (9 #%J!&($2@@9!>2!@ 0 5I$05*0$A$@%#D"!-"0%HE D6D "A H\ %8D) #14($(A-$!M@@& "2I0$@H$#%@%D#"$6@,$Y4 @$ [(# @ X##'00%"RB, $0$92$@E0B!9D!#  CH0%2.% $8  O" -!L"@Q@!&08"Y H0&B! 1C&"*H"6 1"06"T 6"$68C  @ #K"JC!0 "!PE"% >$"8&!. B#"D$DC(""FH 4!E R$$*J2 $R0,2 ""*('"B)B$!&&"&!L1@"#QA! !,.# (2$1&A)(,$"8R"$8*P($$R"B"I@ I"NP@ " LH!&A""*#!"8C!,A#0"D"@7 &#4$$8< &$54$8 " ;- B,1(!!&B6 APH# (Q8!"  Q)'04$@'TU (  R#8!",5A QI@ "(N, $('0Q H82!$ 1Z!$*4 4&"+$B"T I% HF#! 0"(E%*0*@%B DK 52 !&'@$B$$*/( PD$)!@,@,& HE(#1D#$""6$A" A-H"IP"P -AB !)F 4$ D\) HBP# 108P$)E20 .!@4$(,"R!M( #$B" /$"ZB !(%&E  1D= PP")"X ,@%0!.$#9('! 5* Q $HV0  C"M $$B."()EH ((0H'R" 5"4 D##,*!P!*$XH 8)B# Q06( (PC2 @1(2%"#> "8E"H .3"( 0(H4%J(X0 T0 4%/@%0 )8R0 B 5&!)J!B F 3$"HIT  "'(@&#L@D PR0"$T!!"%C,( &8#(*$1%D0!Z+"  "B5($2H(A!*>B   <-P F002$3"!9 *!"A&RDA@ ,(R %09(F 5X D R1 9  02Q#@ 4J%@<"@#EBJ   6!K 2#T !0(9!%D1&# X"&4 F,!!$,A5! *D)* T@@@&BH-! @Z!A ) 6@#3 2$%)- $%P%(1" 9PT "$D:$$6!5 H40I  -C@! 0VX @B-* 5&#0 PJ4 ",",< +) H$Q4"# LA$* !(J5 ("R$#A0 +&D!0T!05@B"< *X A%5 $C04 #JP8" 0.01!B+0P P,@"% &@1'E4!@"*@@P%&,,0!0$Q' J2)$ P&D($4@<("'.($ D+)@ #I!$"(A$I!&!,)"%!!U \A D 0H1. (HPQ 3# %$:@6( A:@""9$)P  &SA D,J( 9( )#$*4E !@1M @@IR 04-!"$Q@Q 4% *&PA!X RPD( #@ =$' #,$3. (! AZ@!4@%1"$$!\!60 / @O0$ CT 0!3($%"4043 .,0B <Q( $B2$8!P"#H!0@*2%( X-$$19$!AJ0) #43! A)B %<* ,!@%.!! &K0"#4 "'1T!($"0)F"1,& %(DF& 3!#("$.!"&."D!!((3&"B"1@&APQ !1' F K$@"$")S( -" )%/ 4* \," "<-@@ "*":"P)00#A$6& ![$ $ )!Q#0 BC%+ E# "L0*""X(4$1!E$") ;@$0 *>"E(0!#)26$ 0HF""F!(A!$%T@!1R ,"(2P1!8@$!'I$05 I$(D"P. 6 7  \ ** Q$@%A4$0)3% D@0'"@01"'$B#&!$2'2 %Q"H @:"%! (!_ '*20 M8($ <"8) P" F#@H4P$C@(6  JHF "0TA$@ "Y%)0CD $J)4 4@C(",H8* T"!D$0AA1$D(*6 Q"A4 &0E@"4D %&$@I0#H0(5! DG8 #M$!  F-@!"S )!)14121412";
    c_data = from_bits(from_base_64(cs));
    verify(c_data);
}

pair<int, int> bsearch1() {
    for (int i = 0; i < 10; i++) {
        vector<int> cv;
        for (int j = 1; j <= 1000; j++) {
            if (on(j, i)) {
                cv.push_back(j);
            }
        }

        send(cv);
    }

    auto res = wait();
    int ans = 0;
    for (int i = 0; i < sz(res); i++) {
        ans |= res[i] << i;
    }

    return {ans, ans};
}

pair<int, int> bsearch2() {
    auto go = [&](const vector<int>& arr) -> optional<int> {
        auto query = [&](int ind) -> bool {
            if (ind > sz(arr)) {
                return true;
            }
            vector tmp(begin(arr), begin(arr) + ind);
            for (auto& a : tmp) {
                a++;
            }
            send(tmp);
            return wait()[0];
        };

        int ans = 0;
        for (int i = 9; i >= 0; i--) {
            if (!query(ans | (1 << i))) {
                ans |= 1 << i;
            }
        }

        if (ans == sz(arr)) {
            return {};
        }
        return arr[ans];
    };

    int cu = *go(iota(1000, 0));
    auto cv = go([&]() {
        auto arr = iota(1000, 0);
        arr.erase(find(begin(arr), end(arr), cu));
        return arr;
    }());

    if (!cv) {
        return {cu + 1, cu + 1};
    } else {
        return {cu + 1, *cv + 1};
    }
}

pair<int, int> scout(int r, int h) {
    if (r == 10 && h == 1) {
        return bsearch1();
    } else if (r == 20 && h == 20) {
        return bsearch2();
    }
    gen_data();
    for (int i = 0; i < m; i++) {
        vector<int> cv;

        for (int j = 0; j < n; j++) {
            if (on(c_data[j], i)) {
                cv.push_back(j + 1);
            }
        }

        send(cv);
    }

    long cans = 0;
    {
        auto res = wait();
        for (int i = 0; i < sz(res); i++) {
            cans |= res[i] << i;
        }
    }

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if ((c_data[i] | c_data[j]) == cans) {
                return {i + 1, j + 1};
            }
        }
    }

    assert(false);
}