10 9 5
0 0 0 0 0 0 0 0 0 4
10 3
10 7
10 5
10 8
10 9
10 1
10 4
10 6
10 2
 10 20 5
2 2 1 4 0 3 0 4 1 3
6 1
8 5
2 10
3 5
1 9
4 6
9 7
2 3
7 4
10 8
4 9
2 5
4 10
2 8
10 3
1 8
8 10
6 7
5 1
10 3
 10 9 2
1 1 0 1 1 1 1 1 1 1
3 10
3 8
3 6
3 7
3 5
3 4
3 1
3 9
3 2
 10 10 5
3 4 2 0 3 0 1 1 2 4
8 9
7 3
5 2
4 8
3 5
6 8
3 5
1 10
10 6
9 1
 10 30 10
7 9 1 5 4 6 0 3 8 2
10 8
8 5
6 1
8 5
3 10
10 8
9 2
8 5
7 3
3 10
1 9
10 8
6 1
1 9
8 5
7 3
1 9
7 3
7 3
4 6
10 8
7 3
3 10
10 8
1 9
8 5
6 1
4 6
3 10
6 1
 6 7 3
0 1 2 0 1 2
1 2
2 3
3 1
3 4
4 5
5 6
6 4
 10 9 2
0 1 0 0 1 0 1 1 1 1
3 7
3 2
8 6
1 7
3 9
5 4
10 1
4 9
6 2
 10 10 10
2 3 5 7 0 8 6 9 4 1
1 2
10 1
5 10
5 10
4 6
8 5
1 2
1 2
7 4
1 2
 10 9 5
1 1 1 1 1 2 1 1 1 1
6 7
6 3
6 5
6 4
6 9
6 8
6 1
6 10
6 2
 10 9 2
0 0 0 0 1 1 0 1 1 1
4 10
8 2
10 3
3 9
1 5
6 2
6 1
7 9
8 7
 5 5 3
2 2 0 1 0
5 4
5 2
1 4
5 1
4 3
 10 9 5
0 4 1 0 1 2 1 0 4 4
8 7
4 3
1 5
2 4
6 5
10 8
9 1
6 7
6 3
 7 8 3
0 0 1 2 2 0 1
1 5
4 3
7 5
1 7
3 2
2 4
6 7
6 5
 10 30 7
5 4 2 3 3 2 5 0 1 6
7 2
2 4
9 3
3 5
5 2
7 10
6 5
10 1
9 8
10 8
3 4
10 4
4 2
7 6
2 8
1 10
5 10
5 6
5 6
6 2
6 5
9 10
8 6
2 4
9 7
1 9
10 4
6 10
9 3
2 7
 5 5 3
1 1 2 0 0
1 3
1 5
2 3
3 4
2 4
 10 10 2
1 1 1 0 1 0 0 0 0 1
4 10
10 7
7 1
5 6
6 3
1 8
2 9
5 4
3 8
2 9
 9 13 3
0 2 1 2 2 0 1 0 1
4 7
9 5
7 5
7 6
9 6
8 2
3 2
8 3
4 3
4 9
1 2
1 3
5 6
 6 3 3
0 1 2 0 1 2
4 5
5 6
4 6
 10 10 5
3 3 3 4 4 1 3 0 2 4
7 5
10 8
10 8
5 8
2 10
9 2
7 4
3 4
7 5
4 8
 10 15 2
1 0 1 1 0 0 1 0 0 1
5 1
7 8
2 10
3 5
1 9
6 4
7 9
2 3
6 4
8 10
9 4
8 4
8 1
10 8
6 7
 2 1 2
1 0
1 2
 5 5 4
0 1 2 3 3
1 2
2 3
3 4
4 1
3 5
 10 9 5
2 1 2 0 1 0 1 2 0 4
10 9
3 7
1 5
10 6
7 9
10 4
5 4
2 6
8 2
 9 10 3
0 2 2 1 0 0 1 2 1
4 6
2 6
5 7
4 8
9 2
9 1
3 5
8 1
3 7
6 2
 10 20 3
2 2 1 1 2 0 0 1 2 2
7 5
7 10
2 7
10 4
10 8
1 7
3 7
9 7
3 10
6 3
4 1
4 1
8 6
3 7
10 3
2 7
8 5
2 7
1 4
2 6
 10 9 8
3 2 1 1 5 6 7 0 4 0
10 7
5 9
10 4
7 6
6 5
3 2
2 1
9 1
3 8

1
1 
 5
1 4 6 7 9 
 10
1 2 3 4 5 6 7 8 9 10 
 1
2 
 1
2 
 3
4 5 6 
 10
1 2 3 4 5 6 7 8 9 10 
 1
2 
 1
6 
 10
1 2 3 4 5 6 7 8 9 10 
 3
1 4 5 
 1
6 
 3
2 3 4 
 8
2 3 4 5 7 8 9 10 
 3
2 3 4 
 2
2 9 
 1
4 
 1
1 
 1
1 
 10
1 2 3 4 5 6 7 8 9 10 
 2
1 2 
 1
5 
 1
1 
 3
3 5 7 
 3
3 7 10 
 1
4 

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
#define ll          long long
#define pb          push_back
#define INF         9223372036854775807
#define    endl        '\n'
#define pii         pair<ll int,ll int>
#define vi          vector<ll int>
#define all(a)      (a).begin(),(a).end()
#define F           first
#define S           second
#define sz(x)       (ll int)x.size()
#define hell        1000000007
#define rep(i,a,b)    for(ll int i=a;i<b;i++)
#define lbnd        lower_bound
#define ubnd        upper_bound
#define bs          binary_search
#define mp          make_pair
#define lower(u)    transform(u.begin(), u.end(), u.begin(), ::tolower);//convert string u to lowercase;
#define upper(u)    transform(u.begin(), u.end(), u.begin(), ::toupper);
#define time        cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
using namespace std;

using namespace __gnu_pbds; 
  
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
#define N  100005

ll n,m,h;
vi adj[N],radj[N];
set<ll>nadj[N];
ll arr[N];
ll col[N];
ll colcount[N];
bool vis[N];
vi top;
void dfs(ll n)
{
    vis[n]=1;
    for(auto u:adj[n])
    {
        if(!vis[u])
            dfs(u);
    }
    top.pb(n);
}
void dfs1(ll n,ll c)
{
    vis[n]=1;
    col[n]=c;
    colcount[c]++;
    for(auto u:radj[n])
    {
        if(!vis[u])
            dfs1(u,c);
    }
}
ll dp[N];
void dfs2(ll n)
{
    vis[n]=1;
    for(auto u:nadj[n])
    if(!vis[u])
    {
        dfs2(u);
    }
    top.pb(n);
}
void dfs3(ll n)
{
    vis[n]=1;
    dp[n]=colcount[n];
    for(auto u:nadj[n])
    {
        if(!vis[u])
        {
            dfs3(u);
            dp[n]+=dp[u];
        }
    }
}
vi fans;
void dfs4(ll n)
{
    vis[n]=1;
    fans.pb(n);
    for(auto u:adj[n])
    {
        if(!vis[u])
            dfs4(u);
    }
}
// ll dfs2(ll n)
// {
//     vis[n]=1;
//     dp[n]=colcount[col[n]];
//     for(auto u:adj[n])
//     {
//         if(!vis[u])
//         {
//             ll c=
//         }
//     }
// }
void solve()
{
    cin>>n>>m>>h;
    rep(i,1,n+1)
    cin>>arr[i];
    rep(i,0,m)
    {
        ll x,y;
        cin>>x>>y;
        if((arr[x]+1)%h==arr[y])
        {
            adj[x].pb(y);
            radj[y].pb(x);
        }
        if((arr[y]+1)%h==arr[x])
        {
            adj[y].pb(x);
            radj[x].pb(y);
        }
    }
    // rep(i,1,n+1)
    // {
    //     cout<<i<<": ";
    //     for(auto u:adj[i])
    //     {
    //         cout<<u<<" ";
    //     }
    //     cout<<endl;
    // }
    rep(i,1,n+1)
    {
        if(!vis[i])
            dfs(i);
    }
    reverse(all(top));
    memset(vis,0,sizeof(vis));
    for(auto u:top)
    {
        if(!vis[u])
        {
            dfs1(u,u);
        }
    }
    // rep(i,1,n+1)
    // {
    //     cout<<col[i]<<" ";
    // }
    // cout<<endl;
    memset(vis,0,sizeof(vis));
    set<ll>dist;
    rep(i,1,n+1)
    {
        dist.insert(col[i]);
        for(auto u:adj[i])
        {
            nadj[col[i]].insert(col[u]);
        }
    }
    top.clear();
    for(auto u:dist)
    {
        if(!vis[u])
            dfs2(u);
    }
    reverse(all(top));
    memset(vis,0,sizeof(vis));
    for(auto u:top)
    {
        if(!vis[u])
            dfs3(u);
    }
    vector<pii>v;
    for(auto u:dist)
    {
        v.pb({dp[u],u});
    }
    sort(all(v));
    memset(vis,0,sizeof(vis));
    ll st=v[0].S;
    dfs4(st);
    cout<<fans.size()<<endl;
    for(auto u:fans)
        cout<<u<<" ";

}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    int TESTS=1;
//    cin>>TESTS;
    while(TESTS--)
    {
        solve();
    }
    time
    return 0;
}