#include <bits/stdc++.h>
using namespace std;

int const N=100010;
int n,m,k,idx;
int a[N],b[N],c[N],stp[N];

bool judge(int x){
    for (int i=1;i<=m;i++){
        if (a[i]==b[x] && i!=x) return 0;
    }
    return 1;
}

int main(){
    
    
    scanf("%d %d %d",&n,&m,&k);
    int fk=k;
    for (int i=1;i<=n;i++){
        scanf("%d",&c[i]);
    }
    for (int i=1;i<=m;i++) scanf("%d %d",&a[i],&b[i]);
    for (int i=m;i && k;i--){
        if (c[a[i]]<c[b[i]] && judge(i)){
            k--;
            stp[++idx]=i;
        }
    }
    printf("%d\n",fk-k);
    for (int i=1;i<=idx;i++) printf("%d\n",stp[i]); 
    
    return 0;
}