#include <bits/stdc++.h>
using namespace std;
template <class T>
T sqr(T x) {
  return x * x;
}
template <class T>
T gcd(T a, T b) {
  return (b != 0 ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(T a, T b) {
  return (a / gcd<T>(a, b) * b);
}
template <class T>
inline T bigmod(T p, T e, T M) {
  if (e == 0) return 1;
  if (e % 2 == 0) {
    long long int t = bigmod(p, e / 2, M);
    return (T)((t * t) % M);
  }
  return (T)((long long int)bigmod(p, e - 1, M) * (long long int)p) % M;
}
template <class T>
inline T bigexp(T p, T e) {
  if (e == 0) return 1;
  if (e % 2 == 0) {
    long long int t = bigexp(p, e / 2);
    return (T)((t * t));
  }
  return (T)((long long int)bigexp(p, e - 1) * (long long int)p);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
int dx4[] = {1, 0, -1, 0};
int dy4[] = {0, 1, 0, -1};
int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};
int month[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
char s[3050][50], x[50], s1[3050][50];
int n, m, l;
int a[3050], b[3050];
int main() {
  scanf("%d %d", &n, &m);
  for (__typeof(m) i = (1); i <= (m); i++) {
    scanf("%s %s", &s[i], &s1[i]);
    a[i] = strlen(s[i]);
    b[i] = strlen(s1[i]);
  }
  for (__typeof(n) i = (1); i <= (n); i++) {
    scanf("%s", &x);
    l = strlen(x);
    if (i == 1) {
      for (int j = 1; j <= m; j++) {
        if (strcmp(x, s[j]) == 0) {
          if (a[j] <= b[j])
            printf("%s", x);
          else
            printf("%s", s1[j]);
          break;
        }
      }
    } else {
      for (int j = 1; j <= m; j++) {
        if (strcmp(x, s[j]) == 0) {
          if (a[j] <= b[j])
            printf(" %s", x);
          else
            printf(" %s", s1[j]);
          break;
        }
      }
    }
  }
  return 0;
}
