#include<bits/stdc++.h>using namespace std;#define ll long long#define pi (4*atan(1.0))#define eps 1e-14const int N=1e6+100,M=4e6+10,inf=1e9+10,mod=1e9+7;const ll INF=1e18+10;struct is{    int x;    int pos;}a[N];int cmp1(is a,is b){    if(a.x!=b.x)    return a.x<b.x;    return a.pos<b.pos;}int cmp2(is a,is b){    if(a.x!=b.x)    return a.x>b.x;    return a.pos>b.pos;}int cmp3(is a,is b){    return a.pos>b.pos;}int cmp4(is a,is b){    return a.pos<b.pos;}int main(){    int n,k1,k2,cas=1;    while(~scanf("%d%d%d",&n,&k1,&k2))    {        if(n==0&&k1==0&&k2==0)            break;        for(int i=1;i<=n;i++)            scanf("%d",&a[i].x),a[i].pos=i;        sort(a+1,a+n+1,cmp1);        sort(a+1,a+k1+1,cmp4);        printf("Case %d\n",cas++);        for(int i=1;i<=k1;i++)            printf("%d%c",a[i].pos,(i!=k1)?‘ ‘:‘\n‘);        sort(a+1,a+n+1,cmp2);        sort(a+1,a+k2+1,cmp3);        for(int i=1;i<=k2;i++)            printf("%d%c",a[i].pos,(i!=k2)?‘ ‘:‘\n‘);    }    return 0;}