How to use BIT data structure for solving the ORDERSET problem of SPOJ?

While going through the editorial of the MBOARD problem I came up across the idea of solving the ORDERSET problem using the BIT data structure. I had solved the ORDERSET problem by augmenting a balanced binary tree. But I could come up with no idea of how to solve the problem with a BIT. So if people can put together their ideas on this, I will be really thankful. Thanks.

Thanks guys, I got my answer. :slight_smile:

care to share???

//