#include<bits/stdc++.h>
using namespace std;
struct song{
    int sum;
    int s;
}sum[100010];

bool cmp(song a,song b){
    return a.sum > b.sum;
}
int k[100][100010];
int main(){
    int n,m,a,b;
    memset(sum, 0, sizeof(song)*100010);
    scanf("%d %d %d %d",&n,&m,&a,&b);
    for(int i = 1;i <= a;i++){
        for(int j = 1;j <= n;j++){
            scanf("%d",&k[i][j]);
            sum[j].sum += k[i][j];
            sum[j].s = j;
        }
    }

    int maxn = 0;
    int maxs = 0;
    for(int i = 1;i <= n;i++){
        if(k[b][i] > maxn){
            maxn = k[b][i];
            maxs = i;
        }
    }
    sort(sum + 1 ,sum + n + 1,cmp);
    int flag = 0;
    for(int i = 1;i <= m;i++){
        if(sum[i].s == maxs ){
            flag = i;
            break;
        }  
    }
    if(flag){
        printf("%d ",maxs);
        for(int i = 1;i <= m;i++){
            if(i == flag){
                continue;
            }
            printf("%d ",sum[i].s);
        }
    }else{
        for(int i = 1;i <= m - 1;i++){
            printf("%d ",sum[i].s);
        }
        printf("%d ",maxs);
    }


    return 0;
}