#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
char tb[]="1234567";
for(unsigned nr=0;;++nr)
{
unsigned NR=0,fact=1,mul=0;
for(char *w=tb+5;w>=tb;--w)
{
unsigned less=0;
for(char *v=tb+6;v>w;--v) if(*v<*w) ++less;
NR+=less*(fact*=(++mul));
}
if(NR!=nr) cout<<NR<<"!="<<nr<<endl; // only if unsigned overflow
if(!next_permutation(tb,tb+7)) break;
}
cout<<"END"<<endl;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKQogIHsKICAgY2hhciB0YltdPSIxMjM0NTY3IjsKICAgZm9yKHVuc2lnbmVkIG5yPTA7OysrbnIpCiAgICAgewogICAgICB1bnNpZ25lZCBOUj0wLGZhY3Q9MSxtdWw9MDsKICAgICAgZm9yKGNoYXIgKnc9dGIrNTt3Pj10YjstLXcpCiAgICAgICAgewogICAgICAgICB1bnNpZ25lZCBsZXNzPTA7CiAgICAgICAgIGZvcihjaGFyICp2PXRiKzY7dj53Oy0tdikgaWYoKnY8KncpICsrbGVzczsKICAgICAgICAgTlIrPWxlc3MqKGZhY3QqPSgrK211bCkpOwogICAgICAgIH0KICAgICAgaWYoTlIhPW5yKSBjb3V0PDxOUjw8IiE9Ijw8bnI8PGVuZGw7IC8vIG9ubHkgaWYgdW5zaWduZWQgb3ZlcmZsb3cKICAgICAgaWYoIW5leHRfcGVybXV0YXRpb24odGIsdGIrNykpIGJyZWFrOwogICAgIH0KICAgY291dDw8IkVORCI8PGVuZGw7CiAgIHJldHVybiAwOwogIH0=