void quick(struct f_word *f, int i, int j)
{int m, n,temp,k;                             char b[18];m = i;n = j;k = f[(i + j) / 2].num;                            do{while (f[m].num>k&&m<j) m++;           while (f[n].num<k&&n>i) n--;            if (m <= n){                                       temp = f[m].num;strcpy(b, f[m].a);f[m].num = f[n].num;strcpy(f[m].a, f[n].a);f[n].num = temp;strcpy(f[n].a, b);m++;n--;}} while (m <= n);if (m<j) quick(f, m, j);                      if (n>i) quick(f, i, n);
}

void swapf(struct f_word *f, int a, int b)
{int temp;char x[word_size];temp = f[b].num;strcpy(x, f[b].wd);f[b].num = f[a].num;strcpy(f[b].wd, f[a].wd);f[a].num = temp;strcpy(f[a].wd, x);
}void vecswap(f_word *f, int a, int b, int n)
{for (int i = 0; i < n; i++, a++, b++)swapf(f, a, b);
}int med3(struct f_word *f, int a, int b, int c)
{return f[a].num< f[b].num ? (f[b].num < f[c].num ? b : f[a].num < f[c].num ? c : a) : f[b].num > f[c].num ? b : f[a].num > f[c].num ? c : a;
}void quick(struct f_word *f, int g, int h)
{int m, n, temp, k;char b[word_size];m = g;n = h;k = f[g].num; if (g >= h)return;do{while (f[m].num>k&&m<h) m++;             while (f[n].num<k&&n>g) n--;            if (m <= n){                                       temp = f[m].num;strcpy(b, f[m].wd);f[m].num = f[n].num;strcpy(f[m].wd, f[n].wd);f[n].num = temp;strcpy(f[n].wd, b);m++;n--;}} while (m <= n);quick(f, m, h);                     quick(f, g, n);
}void qsort7(struct f_word *f, int p, int r)
{char x[word_size];int len = r - p + 1;if (p >= r)return;if (len< 7){for (int i = p; i <= r; i++){for (int j = i; j > p && f[j - 1].num > f[j].num; j--){swapf(f, j, j - 1);}}return;}int m = p + (len >> 1);if (len > 7){int l = p;int n = r;if (len > 40){int s = len / 8;int s2 = 2 * s;l = med3(f, l, l + s, l + s2);m = med3(f, m - s, m, m + s);n = med3(f, n - s2, n - s, n);}m = med3(f, l, m, n);}int v = f[m].num;strcpy(x, f[m].wd);int a = p, b = a, c = p + len - 1, d = c;while (true){while (b <= c && f[b].num <= v){if (f[b].num == v)swapf(f, a++, b);b++;}while (c >= b && f[c].num >= v){if (f[c].num == v)swapf(f, c, d--);c--;}if (b > c)break;swapf(f, b++, c--);}int s, n = p + len;s = (a - p)>(b - a) ? (b - a) : (a - p);vecswap(f, p, b - s, s);s = (d - c)>(n - d - 1) ? (n - d - 1) : (d - c);vecswap(f, b, n - s, s);if ((s = b - a) > 1)qsort7(f, p, s + p - 1);if ((s = d - c) > 1)qsort7(f, n - s, n - 1);}