// yukicoder: No.326 あみだますたー // 2019.5.14 bal4u #include #if 1 #define gc() getchar_unlocked() #define pc(c) putchar_unlocked(c) #else #define gc() getchar() #define pc(c) putchar(c) #endif int in() { int n = 0, c = gc(); do n = 10*n + (c & 0xf), c = gc(); while (c >= '0'); return n; } void out(int n) // 非負整数の表示(出力) { int i; char b[20]; if (!n) pc('0'); else { i = 0; while (n) b[i++] = n % 10 + '0', n /= 10; while (i--) pc(b[i]); } } int a[102], id[102]; typedef struct { int id, a; } T; T tbl[102]; int ans[10100], sz; int bubbleSort(T *tbl, int n) { int i, f; T t; sz = 0; do { f = 0; for (i = n-1; i > 0; i--) { if (tbl[i].id < tbl[i-1].id) { ans[sz++] = i; t = tbl[i-1], tbl[i-1] = tbl[i], tbl[i] = t; f = 1; } } } while (f); } int main() { int i, N, K, x, y, t; N = in(), K = in(); for (i = 1; i <= N; i++) a[i] = i; while (K--) { x = in(), y = in(); t = a[x], a[x] = a[y], a[y] = t; } for (i = 1; i <= N; i++) id[i] = in(); for (i = 1; i <= N; i++) tbl[i].a = a[i], tbl[i].id = id[a[i]]; // for (i = 1; i <= N; i++) printf("(id=%d, a=%d) ", tbl[i].id, tbl[i].a); // printf("\n"); bubbleSort(tbl+1, N); out(sz), pc('\n'); for (i = 0; i < sz; i++) { out(ans[i]), pc(' '), out(ans[i]+1), pc('\n'); } return 0; }