using System; using System.Collections.Generic; using System.Linq; namespace No416{ public class Program{ public static void Main(string[] args){ var sr = new StreamReader(Console.OpenStandardInput()); //--------------------------------- var N = sr.Next(); var M = sr.Next(); var Q = sr.Next(); var AB = sr.Next(M, 2); var CD = sr.Next(Q, 2); Func hash = (s, t) => s * 1000000L + t; var hs = new HashSet(); foreach(var e in CD){ hs.Add(hash(e[0], e[1])); } var qf = new QuickFind(N + 1); foreach(var e in AB){ if(hs.Contains(hash(e[0], e[1]))) continue; qf.Merge(e[0], e[1]); } var res = new int[N + 1]; foreach(var sgi in qf.SameGroupItems(1)){ res[sgi] = -1; } for(var i = CD.Length - 1; i >= 0; i--){ var e = CD[i]; qf.Merge(e[0], e[1]); foreach(var sgi in qf.SameGroupItems(1)){ if(res[sgi] == 0) res[sgi] = i + 1; } } Console.WriteLine(string.Join("\n", res.Skip(2))); //--------------------------------- } } public class Ex{ public static void Swap(ref T left, ref T right){ var tmp = left; left = right; right = tmp; } } public class QuickFind{ //データ構造をマージする一般的なテク public readonly int[] Group; public readonly List[] Items; public QuickFind(int n){ Group = new int[n]; Items = new List[n]; for(var i = 0; i < n; i++){ Group[i] = i; Items[i] = new List{i}; } } public void Merge(int x, int y){ if(Items[Group[x]].Count < Items[Group[y]].Count) Ex.Swap(ref x, ref y); var gx = Group[x]; var gy = Group[y]; if(gx == gy) return; foreach(var iy in Items[gy]){ Group[iy] = gx; } Items[gx].AddRange(Items[gy]); Items[gy].Clear(); } public List SameGroupItems(int x){ return Items[Group[x]]; } public bool IsSameGroup(int x, int y){ return Group[x] == Group[y]; } } public class StreamReader{ private readonly char[] _c = {' '}; private int _index = -1; private string[] _input = new string[0]; private readonly System.IO.StreamReader _sr; public StreamReader(System.IO.Stream st){ _sr = new System.IO.StreamReader(st); } public T Next(){ if(_index == _input.Length - 1){ _index = -1; while(true){ string rl = _sr.ReadLine(); if(rl == null){ if(typeof(T).IsClass) return default(T); return (T)typeof(T).GetField("MinValue").GetValue(null); } if(rl != ""){ _input = rl.Split(_c, StringSplitOptions.RemoveEmptyEntries); break; } } } return (T)Convert.ChangeType(_input[++_index], typeof(T), System.Globalization.CultureInfo.InvariantCulture); } public T[] Next(int x){ var ret = new T[x]; for(var i = 0; i < x; ++i) ret[i] = Next(); return ret; } public T[][] Next(int y, int x){ var ret = new T[y][]; for(var i = 0; i < y; ++i) ret[i] = Next(x); return ret; } } }