Decode the below four famous ciphers:

8P of the SS
1M of the E
1S of the SS
60M in 1H

A man was driving a black truck. His lights were not on. The moon was not out. A lady was crossing the street. How did the man see her?

A man is sitting in a bar when a rich man sits next to him. He turns to the rich man and says, “Did you know I know almost every song that has ever existed?”

The rich man laughs. The man then says, “I bet you all the money you have in your wallet that I can sing a genuine song with a lady’s name of your choice in it. The rich man laughs again and says, “OK, how about my daughter’s name, Jamie Armstrong-Miller?” Minutes later, the man collects his cash and the rich man goes home cashless. What song did the man sing?

The measurement of time, That can't be found on a clock, But can be looked upon on a map.

Who is He ?

What is the end of everything?

John went to a parrot shop in Mexico, and the parrot owner told him that his parrot is so unique that he repeats everything he hears. John got excited and immediately bought the parrot. John went home and spoke many words, but the parrot does not repeat anything.
He went again to the parrot shop and complaint to the shopkeeper, but the shopkeeper never lied. Explain?

Two boys were admitted to a school. When the headmaster asks them about their parents, they tell him that they have same parents (father and mother). On further inquiry, it turns out that they both share the same date for their birthday.

"Are you twins," ask the headmaster.
"No," replies the boys.

Is it possible?

John went to a parrot shop in Mexico, and the parrot owner told him that his parrot is so unique that he repeats everything he hears. John got excited and immediately bought the parrot. John went home and spoke many words, but the parrot does not repeat anything.
He went again to the parrot shop and complaint to the shopkeeper, but the shopkeeper never lied. Explain?

My first is in chocolate but not in ham. My second is in cake and also in jam. My third at tea time is easily found. Altogether, this is a friend who is often around. What is it?

100 prisoners are stuck in the prison in solitary cells. The warden of the prison got bored one day and offered them a challenge. He will put one prisoner per day, selected at random (a prisoner can be selected more than once), into a special room with a light bulb and a switch which controls the bulb. No other prisoners can see or control the light bulb. The prisoner in the special room can either turn on the bulb, turn off the bulb or do nothing. On any day, the prisoners can stop this process and say "Every prisoner has been in the special room at least once". If that happens to be true, all the prisoners will be set free. If it is false, then all the prisoners will be executed. The prisoners are given some time to discuss and figure out a solution. How do they ensure they all go free?