#include int main() { int n, m; scanf("%d %d", &n, &m); int i; int x[1003], y[1003]; for (i = 0; i < n; i++) scanf("%lld", &x[i]); for (i = 0; i < m; i++) scanf("%lld", &y[i]); for (i = 0; i < m - 1; i++) { if (y[i] > y[i + 1]) { y[i] ^= y[i + 1]; y[i + 1] ^= y[i]; y[i] ^= y[i + 1]; if (i > 0) i -= 2; } } int min, mid, max; y[m] = -1; for (i = 0; i < n; i++) { min = -1; max = m; while (max - min > 1) { mid = (max + min) / 2; if (y[mid] < x[i]) min = mid; else max = mid; } if (max == m) printf("Infinity\n"); else printf("%d\n", y[max] - x[i]); } return 0; }