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>
using namespace std;
enum Color { white, grey, black };
class Vertex {
 public:
  vector<int> edges;
  set<int> checkEdge;
  int color, sssID;
  int answer;
  void addEdge(int v);
  Vertex() {
    color = Color::white;
    answer = 1;
  }
};
void Vertex::addEdge(int v) {
  if (!checkEdge.count(v)) {
    edges.push_back(v);
  }
}
class StronglyConnected {
 private:
  vector<int> topoSortVec;
  int currentSSS;
  int DFSAnswer(int u, set<int> &SSSCountedSet);
  void DFSPrintAnswer(int u);
  void clearGraph(vector<Vertex> &G);
  int DFS(vector<Vertex> &G, function<void(int)> &preFun,
          function<void(int)> &inFun, function<void(int)> &postFun, int u);

 public:
  vector<Vertex> G;
  vector<Vertex> GT;
  vector<int> SSSRepresentant;
  vector<int> SSSAnswer;
  int minAnswerSSID;
  StronglyConnected(size_t n) : G(n), GT(n) { currentSSS = 0; }
  void addPath(int u, int v);
  void topoSort();
  void findSSS();
  void findAnswer();
  void printAnswer();
};
void StronglyConnected::addPath(int u, int v) {
  G[u].addEdge(v);
  GT[v].addEdge(u);
}
void StronglyConnected::topoSort() {
  function<void(int)> preFun, inFun, postFun;
  auto DFSTopoSort = [this, &preFun, &inFun, &postFun](int u) {
    DFS(G, preFun, inFun, postFun, u);
  };
  preFun = [this](int u) {};
  inFun = [&DFSTopoSort, this](int u) {
    if (G[u].color == Color::white) {
      DFSTopoSort(u);
    }
  };
  postFun = [this](int u) { topoSortVec.push_back(u); };
  for (int u = 0; u < G.size(); u++) {
    if (G[u].color == Color::white) {
      DFSTopoSort(u);
    }
  }
  reverse(topoSortVec.begin(), topoSortVec.end());
}
void StronglyConnected::findSSS() {
  currentSSS = 0;
  function<void(int)> preFun, inFun, postFun;
  auto DFSFindSSS = [this, &preFun, &inFun, &postFun](int u) {
    DFS(GT, preFun, inFun, postFun, u);
  };
  preFun = [this](int u) {
    GT[u].sssID = currentSSS;
    G[u].sssID = currentSSS;
  };
  inFun = [&DFSFindSSS, this](int u) {
    if (GT[u].color == Color::white) {
      DFSFindSSS(u);
    }
  };
  postFun = [this](int u) {};
  for (auto u : topoSortVec) {
    if (GT[u].color == Color::white) {
      SSSRepresentant.push_back(u);
      DFSFindSSS(u);
      currentSSS++;
    }
  }
}
void StronglyConnected::clearGraph(vector<Vertex> &G) {
  for (auto &vertex : G) {
    vertex.color = Color::white;
  }
}
int StronglyConnected::DFSAnswer(int u, set<int> &SSSCountedSet) {
  G[u].color = Color::grey;
  int myAnswer = 1;
  SSSCountedSet.insert(G[u].sssID);
  for (auto v : G[u].edges) {
    if (G[v].color == Color::white) {
      myAnswer += DFSAnswer(v, SSSCountedSet);
    } else if (G[v].color == Color::black && !SSSCountedSet.count(G[v].sssID)) {
      myAnswer += SSSAnswer[G[v].sssID];
      SSSCountedSet.insert(v);
    }
  }
  SSSAnswer[G[u].sssID] = max(SSSAnswer[G[u].sssID], myAnswer);
  G[u].color = Color::black;
  return myAnswer;
}
void StronglyConnected::findAnswer() {
  clearGraph(G);
  SSSAnswer = vector<int>(currentSSS, 0);
  for (auto u : topoSortVec) {
    if (G[u].color == Color::white) {
      set<int> tmpSet;
      DFSAnswer(u, tmpSet);
    }
  }
  int minAnsw = 100000000;
  for (int i = 0; i < currentSSS; i++) {
    if (SSSAnswer[i] < minAnsw) {
      minAnsw = SSSAnswer[i];
      minAnswerSSID = i;
    }
  }
}
void StronglyConnected::DFSPrintAnswer(int u) {
  G[u].color = Color::grey;
  cout << (u + 1) << " ";
  for (auto v : G[u].edges) {
    if (G[v].color == Color::white) {
      DFSPrintAnswer(v);
    }
  }
  G[u].color = Color::black;
}
void StronglyConnected::printAnswer() {
  clearGraph(G);
  cout << SSSAnswer[minAnswerSSID] << endl;
  DFSPrintAnswer(SSSRepresentant[minAnswerSSID]);
  cout << endl;
}
int StronglyConnected::DFS(vector<Vertex> &G, function<void(int)> &preFun,
                           function<void(int)> &inFun,
                           function<void(int)> &postFun, int u) {
  G[u].color = Color::grey;
  preFun(u);
  for (auto v : G[u].edges) {
    inFun(v);
  }
  postFun(u);
  G[u].color = Color::black;
  return 0;
}
class Solution {
 public:
  int n, m, k;
  vector<int> centerUpdateTime;
  shared_ptr<StronglyConnected> stronglyConnected;
  Solution() {}
  void addEdge(int centerA, int centerB) {
    if (centerUpdateTime[centerA] > centerUpdateTime[centerB]) {
      swap(centerA, centerB);
    }
    if (centerUpdateTime[centerB] == k - 1 && centerUpdateTime[centerA] == 0) {
      stronglyConnected->addPath(centerB, centerA);
    }
    if (centerUpdateTime[centerB] - centerUpdateTime[centerA] == 1) {
      stronglyConnected->addPath(centerA, centerB);
    }
  }
  void readData() {
    cin >> n >> m >> k;
    centerUpdateTime = vector<int>(n);
    stronglyConnected = make_shared<StronglyConnected>(n);
    for (int i = 0; i < n; i++) {
      cin >> centerUpdateTime[i];
    }
    int centerA, centerB;
    for (int i = 0; i < m; i++) {
      cin >> centerA >> centerB;
      addEdge(centerA - 1, centerB - 1);
    }
  }
  void findSolution() {
    readData();
    stronglyConnected->topoSort();
    stronglyConnected->findSSS();
    stronglyConnected->findAnswer();
    stronglyConnected->printAnswer();
  }
};
int main() {
  Solution solution;
  solution.findSolution();
  return 0;
}
