// Find the next lexicographically
// greater permutation of a word
#include <algorithm>
#include <iostream>
using namespace std;
int main()
{
string s = { "gfg" };
bool val
= next_permutation(s.begin(),
s.end());
if (val == false)
cout << "No Word Possible"
<< endl;
else
cout << s << endl;
return 0;
}
Ly8gRmluZCB0aGUgbmV4dCBsZXhpY29ncmFwaGljYWxseSAKLy8gZ3JlYXRlciBwZXJtdXRhdGlvbiBvZiBhIHdvcmQgCgojaW5jbHVkZSA8YWxnb3JpdGhtPiAKI2luY2x1ZGUgPGlvc3RyZWFtPiAKCnVzaW5nIG5hbWVzcGFjZSBzdGQ7IAoKaW50IG1haW4oKSAKeyAKCXN0cmluZyBzID0geyAiZ2ZnIiB9OyAKCWJvb2wgdmFsIAoJCT0gbmV4dF9wZXJtdXRhdGlvbihzLmJlZ2luKCksIAoJCQkJCQlzLmVuZCgpKTsgCglpZiAodmFsID09IGZhbHNlKSAKCQljb3V0IDw8ICJObyBXb3JkIFBvc3NpYmxlIgoJCQk8PCBlbmRsOyAKCWVsc2UKCQljb3V0IDw8IHMgPDwgZW5kbDsgCglyZXR1cm4gMDsgCn0gCg==