#include<bits/stdc++.h>
using namespace std;
int n,m,k,sum;
int c[200005],a[200005],b[200005];
short t[100005];
queue <int> q;
//void dfs()
int main(){
	freopen("Florr.in","r",stdin);
	freopen("Florr.out","w",stdout);
	cin>>n>>m>>k;
	for(int i=1;i<=n;i++){
		cin>>c[i];
	}
	for(int i=1;i<=m;i++){
		cin>>a[i]>>b[i];
		t[a[i]]=i;
	}
	for(int i=m;i>=1;i--){
		if(sum==k) continue;
		if(c[a[i]]<c[b[i]]){
			if(!t[b[i]]){
				t[b[i]]=i;
				t[a[i]]=0;
				sum++;
				q.push(i);
			}
		}
	}
	cout<<sum<<endl;
	while(q.size()){
		cout<<q.front()<<endl;
		q.pop();
	}
	return 0;
}